How to check whether the following graph is Hamiltonian or Eulerian or both.
Attachments:
Answers
Answered by
3
Answer:
This graph is Hamiltonian. Plz mark my answer as brainliest answer
Answered by
1
Answer:
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. For instance, the graph below has 20 nodes. The edges consist of both the red lines and the dotted black lines.
: A graph is Eulerian if and only if each vertex has an even degree. The graph on the left is not Eulerian as there are two vertices with odd degree, while the graph on the right is Eulerian since each vertex has an even degree.
Hamiltonian graph
Step-by-step explanation:
plz follow me
Similar questions