Consider the network shown in.
a. In addition to the pair
b. If you can, find two vertices in the network having seven degrees of separation between them. If you can’t, then briefly explain why you don’t think there are any.
c. What is the diameter of the network?
Want to see the full answer?
Check out a sample textbook solutionChapter 7 Solutions
Excursions in Modern Mathematics (9th Edition)
- (a) Which vertices can reach vertex 2 by a walk of length 3? (d) Is (2, 2) in the transitive closure of G? (e) Is (5, 3) an edge in G3? (f) Is there a closed walk of length 3 in G?arrow_forwardS= {A,D} and T={B,C,E} for the network in exercise #8 Tell whether the given sets of S, T form a cut for the network indicated. If so, give the capacity of the cut. If not, tell why.arrow_forwardDraw the network diagram for the above project.arrow_forward
- Prove that If a connected planar simple graph has e edges and v vertices with v ≥ 3 and no circuits of length three, then e ≤ 2v − 4. (Show work)arrow_forward(a) What are the edges incident on v2? (b) What are the vertices adjacent to v2 ? (c) What are the edges adjacent to e2 ?arrow_forwardFor which values of m and n does the complete bipartite graph Km,n have an Euler circuit?arrow_forward
- Consider the following graph, which represents the one-way airfare between five cities. A B C D E A * $220 $240 $290 $430 B $220 * $260 $320 $360 C $240 $260 * $180 $300 D $290 $320 $180 * $250 E $430 $360 $300 $250 * Graph the following to represent the information in the table. Use vertices to represent the cities and weights on appropriate edges to show the airfares. Next, assume that you are a salesman who lives in one of the cities (pick any city except for A) and required to fly to all four of the other cities and return to your home city. Describe how you would use the Nearest Neighbor Method to determine the optimal route. What is the total cost for this Hamilton circuit?arrow_forwardLet x and y be two adjacent vertices in the complete bipartite graph Kn,n, n ≥ 3.Find the number of x-y paths of length 2, of length 3, and of length 4.arrow_forwardFor which m and n does the graph Km,n contain an Euler path? An Euler circuit? Explain.arrow_forward
- Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill EducationMathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
- Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSONDiscrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education