1. An "X" in the table below indicates a direct train route between the corresponding cities. Draw a graph that represents this information, in which each vertex represents a city and an edge connects two vertices if there is a train route between the corresponding cities. Springfield Riverside Greenfield Watertown Midland Newhope Springfield X Riverside X X Greenfield X X X Watertown X X Midland X X X X Noubone

1. An "X" in the table below indicates a direct train route between the corresponding cities. Draw a graph that represents this information, in which each vertex represents a city and an edge connects two vertices if there is a train route between the corresponding cities. Springfield Riverside Greenfield Watertown Midland Newhope Springfield X Riverside X X Greenfield X X X Watertown X X Midland X X X X Noubone

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

Recall that a bridge in a connected graph is an edge whose removal disconnects the graph. The maximum number of edges in a graph on 10 vertices that contains a bridge is _______.
G2. Draw a graph with the set of vertices V = {a, b, c, d} and the set of edges E= {{b, c), {c, d), (a, d}}. Find the degree of vertex a.
2. Draw a graph with the following vertex and edge sets: (a) V = {a,b, c, d, e, f} and E = {ac, ad, ba, eƒ, dc, de} %3D (b) V = {a, 8, 7, 4} and E = {ad, &y, yø, pa, p8, ya} %3D
2
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
4. Suppose the city of Königsberg had the arrangement of islands and bridges pictured on the left instead of the arrangement that we introduced previously. Represent the map as graph. Would the citizens be able to complete a stroll across each bridge and return to their starting points without crossing the same bridge twice? Explain why or why not.
In order to eulerize the graph below, give the fewest number of edges that need to be duplicated. a 1 b 2 C 3 d 4 O O O O
2 5 10 6 5 10 11 16 9 14 10 1. Degree of a Vertex - Enumerate all vertices in this graph and identify their degrees.
31. In any undirected graph the sum of degrees of all the nodes A. must be even B. are twice the number of edges C. must be odd D. need not be even
Consider a simple graph G with 7 vertices labeled A through G. Suppose that every vertex is connected to every other vertex, except for vertex C, which is only connected to vertex A and vertex B. How many edges does the graph G have?
Q16. 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} E = {{a, b, 9}, {a, c, 6}, {a, d, 1}, {a, f, 4}, {b, c, 2}, {b, f, 8}, {c, d, 3}, {c, f, 5}, {d, e, 4}, {d, f, 8}} a Your Answer: 3 f What is the total weight of a minimum spanning tree of the graph? Answer d CD
2. A graph has vertices of degrees 0, 2, 2, 3, and 9. How many edges does the graph have?