Part 1. Give the adjacency matrix for the graph G as pictured below: Figure 2: A graph shows 6 vertices and 9 edges. The vertices are 1, 2, 3, 4, 5, and 6, represented by circles. The edges between the vertices are represented by arrows, as follows: 4 to 3; 3 to 2; 2 to 1; 1 to 6; 6 to 2; 3 to 4; 4 to 5; 5 to 6; and a self loop on vertez 5. Part 2. A directed graph G has 5 vertices, numbered_1 through 5. The 5 x 5 matrix A is the adjacency matrix for G. The matrices A² and A° are given below. '0 1 0 0 0 00 1 00 00 00 100 1. 0 1 10 0 0 0 0 1 0 0 0 0 0 10 0 0 1 10 1 1 1 0 1 0 A Use the information given to answer the questions about the graph G. (a) Which vertices can reach vertex 2 by a walk of length 3? (b) Is there a walk of length 4 from vertex 4 to vertex 5 in G? (Hint: A =

Part 1. Give the adjacency matrix for the graph G as pictured below: Figure 2: A graph shows 6 vertices and 9 edges. The vertices are 1, 2, 3, 4, 5, and 6, represented by circles. The edges between the vertices are represented by arrows, as follows: 4 to 3; 3 to 2; 2 to 1; 1 to 6; 6 to 2; 3 to 4; 4 to 5; 5 to 6; and a self loop on vertez 5. Part 2. A directed graph G has 5 vertices, numbered_1 through 5. The 5 x 5 matrix A is the adjacency matrix for G. The matrices A² and A° are given below. '0 1 0 0 0 00 1 00 00 00 100 1. 0 1 10 0 0 0 0 1 0 0 0 0 0 10 0 0 1 10 1 1 1 0 1 0 A Use the information given to answer the questions about the graph G. (a) Which vertices can reach vertex 2 by a walk of length 3? (b) Is there a walk of length 4 from vertex 4 to vertex 5 in G? (Hint: A =

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

1. Answer the following questions based on the graph below: a d a) Find the number of verticals and Find the number of edges. B) Find the degree of each vertex. C) Represent the graph with an adjacency matrix.
Question 3 Draw a diagram representing the graph with the following vertices and edges V = {A, B, C, D}, E = {{A, B}, {A, C}, {A, D}, {B, C}, {B, D}, {C, D}}
Indicate if each of the two graphs are equal. Figure 1: Left: An undirected graph has 5 vertices. The vertices are arranged in the form of an inverted pentagon. From the top left vertex, moving clockwise, the vertices are labeled: a, b, c, d, and e. Undirected edges, line segments, are between the following vertices: a and b; a and c; b and c; c and d; e and d; and e and c. Figure 2: Right: The adjacency list representation of a graph. The list shows all the vertices, a through e, in a column from top to bottom. The adjacent vertices for each vertex in the column are placed in a row to the right of the corresponding vertex’s cell in the column. An arrow points from each cell in the column to its corresponding row on the right. Data from the list, as follows: Vertex a is adjacent to vertices b and c. Vertex b is adjacent to vertices a and c. Vertex c is adjacent to vertices a, b, d, and e. Vertex d is adjacent to vertices c and e. Vertex e is adjacent to vertices c and d.
Find the connected components of the graph: G = (V, E). V = {a, b, c, d, e, f, g, h, i, j}. E = {{f.h}, {e,d}, {c,b}, {i.j}, {a,b}, {i.f}. {f.j} }
II. Do as instructed in the following. (A.) G b d 9 1. Give the order and size of G 2. Construct the degree table. 3. Construct adjacency matrix. 4. Give 2 (5,5) graphs and give the vertex and edge set.
Part 1. Give the adjacency matrix for the graph G as pictured below: 3 Figure 2: A graph shows 6 vertices and 9 edges. The vertices are 1, 2, 3, 4, 5, and 6, represented by circles. The edges between the vertices are represented iry arrous, as follouIs: 4 to 3; 3 to 2; 2 to 1; 1 to 6; 6 to 2; 3 to 4: 4 to 5: 5 to 6; and a self loop on verter 5.
Q29. If we need a lot of adding and removing edges to a graph, it is better to represent the graph as .......... Adjacency matrix Adjacency list
Q7A. Consider the graph with the following vertices and edges: V = {a, b, c, d, e, f} E = {{a, b}, {a, c}, {a, d}, {a, f}, {b, c}, {b, f}, {c, d}, {c, f}, {d, e}, {d, f}} b a C f d e Which of the following are Euler trails in the graph? (Select all that apply.)
If a connected graph with 12 edges splits the plane into 4 regions, then how many vertices should this graph have? Select one: O a. 6 O b. 8 O c. 13 O d. 12 O e. 10
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, 6}, {b, c, 11}, {b, e, 9}, {b, f, 4}, {c, d, 11}, {c, g, 14}, {d, e, 12}, {d, f, 10}, {f, g, 16}} a Your Answer: 2 d What is the total weight of a minimum spanning tree of the graph? Answer CD g
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?
Q10A. Consider the graph with the following vertices and edges: V = {a, b, c, d, e, f} E = {{a, b}, {a, c}, {a, d}, {a, f}, {b, c}, {b, e}, {b, f}, {c, d}, {c, f}, {d, e}, {d, f}} Which of the following are examples of circuits within the graph? (Select all that apply.) | d