3. a. Define the following with an example; i. paths ii. simple graph 3 21 b.Draw the graph with the adjacency matrix 1 1 1 with 2 respect to the 1 12 1 2 ordering of vertices, a, b, c, d. i. Find the degree of each vertex in your graph from part (a) above. ii. How many walks of length 2 are there from the vertex c to c? How many of these walks are paths?

3. a. Define the following with an example; i. paths ii. simple graph 3 21 b.Draw the graph with the adjacency matrix 1 1 1 with 2 respect to the 1 12 1 2 ordering of vertices, a, b, c, d. i. Find the degree of each vertex in your graph from part (a) above. ii. How many walks of length 2 are there from the vertex c to c? How many of these walks are paths?

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Hi! have a nice day ahead :)
9.1 Explain whether a graph with each of the following characteristics exists. If so, give an example. If not, justify your answer. (a) A planar graph with 6 vertices, 10 edges and 5 faces. (b) A planar graph G with 6 vertices with degrees 2, 2, 3, 4, 4, 5. (c) A planar graph with 7 vertices, 10 edges and 4 faces. (d) A planar graph with 10 vertices and edges.
a C c and d b and c b and d d and f e and f a and b c and f a and e 4 e Select all pairs of vertices which are adjacent in the graph.
For the graph below determine the minimum number of colors necessary to colorits vertices. Justify your answer, by (i) giving a coloring and (ii) explaining why it is not possibleto use fewer colors. You can represent colors by letters a, b, c, .... To show the coloring, mark eachvertex with its color.
Q17. Consider the graph with the following vertices, edges, and weights (weights are stated as the third entry for each edge in E, with the first two entries representing the vertices joined by the edge): V = {a, b, c, d, e, f, g} E = {{a, b, 10}, {a, c, 12}, {a, d, 15}, {a, f, 3}, {b, c, 11}, {b, e, 9}, {b, f, 7}, {c, d, 11}, {c, g, 15}, {d, e, 12}, {d, f, 10}, {f, g, 16}} b a Your Answer: d Answer CD e What is the total weight of a minimum spanning tree of the graph? g
Consider the following graph; S Which of the following graphs are subgraphs of the graph above? □A. P5 B. K1,4 C. K6 ☐D. P₂2 □E. C₁ F. K3,3 G. K5 O
Q1D. Consider the following graph: a с f d e How many vertices are there in the graph? How many edges are there in the graph? A
Q17. Consider the graph with the following vertices, edges, and weights (weights are stated as the third entry for each edge in E, with the first two entries representing the vertices joined by the edge): V = {a, b, c, d, e, f, g} E = {{a, b, 10}, {a, c, 12}, {a, d, 15}, {a, f, 5}, {b, c, 11}, {b, e, 9}, {b, f, 2}, {c, d, 11}, {c, g, 12}, {d, e, 12}, {d, f, 10}, {f, g, 16}} b a d e CD What is the total weight of a minimum spanning tree of the graph?
v. In the graph below determine whether the following graphs are paths, simple paths, circuits, or simple circuits? e2 V2 e7 e5, G: es VA ea e10, e9 e6 V5 V6 d) V4egV4C3V;C,V½e,V;C,V4,
Identify: (x and y indicated in the problem are the x and y in the graph) a. vertices incident to x b. vertices adjacent to dc. edges incident to ad. edges adjacent to y
Subject-advance maths
Q20C. In what order are the vertices visited in a pre-order traversal of the tree below? (Enter answer as a simple string of letters, using no commas or spaces. For example: xyzwvu) C f 8.0 g b a d e