A Mathematical View of Our World. 1 st ed. Parks, Musser, Trimpe, Maurer, and Maurer. Chapter 6. Routes and Networks. Section 6.1 Routing Problems. Goals Study graphs, vertices, and edges Study paths and circuits Study connected graphs Use Euler’s Theorem Use Fleury’s Algorithm.
Parks, Musser, Trimpe, Maurer, and Maurer
Routes and Networks
List all the vertices that are adjacent to the vertex labeled Portland.
a. Salem, Boise, Olympia
b. Salem, Spokane
c. Salem, Olympia, Seattle, Spokane
A and C, B and C, B and D, C and D.
Does the graph have an Euler circuit, an Euler path, or neither?
a. Euler circuit
b. Euler path only
Are there any redundant edges in the graph?
Choose the graph that is a tree.
always has edges.
A graph has 20 vertices and 195 edges. Is the graph complete?
n! = n(n – 1)(n – 2)(n – 3)…(1).
How many possible Hamiltonian circuits exist in a complete graph with 9 vertices?
What is the cost of the path ABD in the graph below?