- #1
jaus tail
- 615
- 48
- Homework Statement
- Is the graph Hamilton and Eulerian?
- Relevant Equations
- Hamilton: Path exists that covers all nodes. Starting and Ending node is same. Each node covered only once.
Eulerian: Path exists that covers all paths. Starting and ending node is same. Each path covered only once.
Is the graph Hamilton and Eulerian?
The website says the graph is Hamilton and Eulerian but I think it's wrong.
Ref: https://scanftree.com/Graph-Theory/Eulerian-and-Hamiltonian-Graphs
There is no path that covers all paths only once. Any help? I think the graph is drawn wrongly.
The website says the graph is Hamilton and Eulerian but I think it's wrong.
Ref: https://scanftree.com/Graph-Theory/Eulerian-and-Hamiltonian-Graphs
There is no path that covers all paths only once. Any help? I think the graph is drawn wrongly.
Last edited by a moderator: