Use the graph below to answer the homework questions that follow U5 V4 V3
Use the graph below to answer the homework questions that follow. e2 V2
vo V2 a. Check all properties that apply to the sequence of edges below: v1 v2 v4 v2 v3 Select 1 or more: i) It is Walk ii) Path iii) Circuit iv) Simple Circuit
V6
Us
V4
a) Check all properties that apply to the sequence of edges below: v1 v3 v4 v2 v6 v1 Select 1 or more: j) It is Walk ii) Path iii) Circuit iv) Simple Circuit
b. Check all properties that apply to the sequence of edges below v1 v4 v2 v1 Select 1 or more: j) It is Walk ii) Path iii) Circuit iv) Simple Circuit
b) Check all properties that apply to the sequence of edges below: v1 v3 v4 v2 Select 1 or more: i) It is Walk ii) Path iii) Circuit iv) Simple Circuit
c. How many distinct paths are there from vo to v?
d. How many distinct simple circuits are there starting and ending at v?
c. How many distinct paths are there from v to v?
e. The graph above does not have an Euler circuit. Suppose you are able to add ONE edge to the graph. Which of the following edges, if added, would make it possible for the graph to have an Euler circuit? Select one or more: i) v0-v3 ii) v0-v4 iii) v3-v4 iv) v0-v1 v) it is not possible to have an Euler circuit by adding a single edge.
d) How many distinct simple circuits are there starting and ending at v?
e) The graph has an Euler Circuit. True or False.
f. The graph has a Hamiltonian Circuit. True or False.
f. The graph above does not have a Hamiltonian circuit. Suppose you are able to add ONE edge to the graph. Which of the following edges, if added, would make it possible for the graph to have a Hamiltonian circuit? Select one or more: i) v0-v3 ii) v0-v4 iii) v3-v4 iv) v0-v1 v) it is not possible to have a Hamiltonian circuit by adding a single edge.