Discrete Mathematics Use the graph to answer the following questions 9 (a) (4 Points) Label one...
Discrete Math Create a graph with 4 vertices of degrees 2, 2, 3, 3 or explain why no such graph exists. If the graph exists, draw the graph, label the vertices and edges. To answer the question in the box below, write the vertex set, the edge set, and the edge-endpoint function as shown on page 627 of the text. You can copy (Ctrl-C) and paste(Ctrl-V) the table to use in your answer if you like. Vertex set- Edge set...
Discrete Mathematics 6: A: Draw a graph with 5 vertices and the requisite number of edges to show that if four of the vertices have degree 2, it would be impossible for the 5 vertex to have degree 1. Repetition of edges is not permitted. (There may not be two different bridges connecting the same pair of vertices.) B: Draw a graph with 4 vertices and determine the largest number of edges the graph can have, assuming repetition of edges...
4. (10 points) (a) An undirected graph has 6 vertices and 13 edges. It is known three vertices have degree 3, one has degree 4, and another one has degree 7. Find the degree of the remaining vertex. (b) For each of the following graphs, determine if it is bipartite, complete, and/or a tree. Give a brief written or graphical justification for your answers (you may address multiple graphs at the same time). iii.
8. For each of the following, either draw a undirected graph satisfying the given criteria or explain why it cannot be done. Your graphs should be simple, i.e. not having any multiple edges (more than one edge between the same pair of vertices) or self-loops (edges with both ends at the same vertex). [10 points] a. A graph with 3 connected components, 11 vertices, and 10 edges. b. A graph with 4 connected components, 10 vertices, and 30 edges. c....
8. For each of the following, either draw a undirected graph satisfying the given criteria or explain why it cannot be done. Your graphs should be simple, i.e. not having any multiple edges (more than one edge between the same pair of vertices) or self-loops (edges with both ends at the same vertex). [10 points] a. A graph with 3 connected components, 11 vertices, and 10 edges. b. A graph with 4 connected components, 10 vertices, and 30 edges. c....
question 1 and 2 please, thank you. 1. In the following graph, suppose that the vertices A, B, C, D, E, and F represent towns, and the edges between those vertices represent roads. And suppose that you want to start traveling from town A, pass through each town exactly once, and then end at town F. List all the different paths that you could take Hin: For instance, one of the paths is A, B, C, E, D, F. (These...
ignore red marks. Thanks 10. (16) You will compute the strongly connected components of this graph in three steps. a. STRONGLY-CONNECTED-COMPONENTS (G) (7) Perform a depth-first search on call DFS(G) to compute finishing times w/ for each vertex the following graph. (To make 2 compute GT this easier to grade, everyone call DFS(GT), but in the main loop of DFS, consider the vertices in order of decreasing wf (as computed in line 1) please start with vertex "a" and 4...
COMP Discrete Structures: Please answer completely and clearly. (3). (5). x) (4 points) If k is a positive integer, a k-coloring of a graph G is an assignment of one of k possible colors to each of the vertices/edges of G so that adjacent vertices/edges have different colors. Draw pictures of each of the following (a) A 4-coloring of the edges of the Petersen graph. (b) A 3-coloring of the vertices of the Petersen graph. (e) A 2-coloring (d) A...
9. Consider the graph in problem 8, call it G. a) Find at least one non-trivial graph automorphism on G. That is, find a graph isomorphism f:G -G. Show that there are bijective mappings g: V(G)-V(G) and h: E(G)-E(G). Show that the mappings preserve the edge-endpoint function for G. b) Find a mapping fl:G G that is the inverse of the automorphism you found in part a c) Show that fof- I, which is the identity automorphism that sends each...
Help !! I need help with Depth-First Search using an undirected graph. Write a program, IN JAVA, to implement the depth-first search algorithm using the pseudocode given. Write a driver program, which reads input file mediumG.txt as an undirected graph and runs the depth-first search algorithm to find paths to all the other vertices considering 0 as the source. This driver program should display the paths in the following manner: 0 to āvā: list of all the vertices traversed to...