document.write( "Question 1160738: Which of the following is a Hamiltonian Circuit, beginning at vertex A, for the given graph?\r
\n" ); document.write( "\n" ); document.write( "A. ADBCA\r
\n" ); document.write( "\n" ); document.write( "B. ABCDA\r
\n" ); document.write( "\n" ); document.write( "C. ACBDA\r
\n" ); document.write( "\n" ); document.write( "D. all of the above\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The graph for the question and the question itself are in the question here: https://i.imgur.com/TCEqxzO.png
\n" ); document.write( "

Algebra.Com's Answer #784131 by solver91311(24713)\"\" \"About 
You can put this solution on YOUR website!
\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "A connected graph is said to have a Hamiltonian circuit if it has a circuit that ‘visits’ each node (or vertex) exactly once. A graph that has a Hamiltonian circuit is called a Hamiltonian graph.
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "John
\n" ); document.write( "
\n" ); document.write( "My calculator said it, I believe it, that settles it
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" );