MO640 - Multiple-choice question
Consider a simple, connected graph composed solely by two cycles that share exactly one vertex, in a format that resembles a bow tie. Which if the following statements is true?- This graph is not Eulerian or Hamiltonian.
- This graph is Eulerian, but not Hamiltonian.
- This graph is Hamiltonian, but not Eulerian.
- This graph is both Eulerian and Hamiltonian.
- None of the above
No comments:
Post a Comment