If a Circuit of a Graph Visits Each Vertex Exactly

question 42

Multiple Choice

If a circuit of a graph visits each vertex exactly once, then it is called a(n) _______________.

• A)Euler circuit
• B)Hamilton circuit
• C)Vector circuit
• D)Fleury circuit