![C:\Users\ryan\AppData\Local\Microsoft\Windows\INetCacheContent.Word\graphs_03.png]()
1.
a. Looking at the above graph, identify the number of odd vertices.
b. Looking at the above graph, identify the number of even vertices.
c. Looking at the above graph. Does it have an Euler circuit? Does it have an Euler path? Explain your answers.
![C:\Users\ryan\AppData\Local\Microsoft\Windows\INetCacheContent.Word\graphs_04.png]()
2.
a. Looking at the above graph, identify the number of odd vertices.
b. Looking at the above graph, identify the number of even vertices.
c. Looking at the above graph. Does it have an Euler circuit? Does it have an Euler path? Explain your answers.
![C:\Users\ryan\AppData\Local\Microsoft\Windows\INetCacheContent.Word\graphs_05.png]()
3. Find 3 different Hamilton circuits in the graph above.
![C:\Users\ryan\AppData\Local\Microsoft\Windows\INetCacheContent.Word\graphs_06.png]()
4. How many distinct Hamilton circuits does the graph above have? List them using A as the starting vertex.
5. How many edges are in K17, the complete graph with 17 vertices?
6. Explain why the graph below has no Hamilton circuit but does have a Hamilton path.
![C:\Users\ryan\AppData\Local\Microsoft\Windows\INetCacheContent.Word\graphs_07.png]()
Page 1 of 3
Jmarozik
GraphTheoryandTravellingSalesmanProblemworksheet.docx
0
