2 2 votes Draw a eular graph which is not hamiltonian Graph Theory + – srestha 1.0k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 4 4 votes http://www.personal.kent.edu/~rmuhamma/GraphTheory/MyGraphTheory/eulerGraph.htm LeenSharma answered Nov 2, 2015 • selected Dec 3, 2015 by Akash Kanase LeenSharma comment Share Follow See all 3 Comments 3 3 Comments reply srestha commented Nov 2, 2015 reply Follow flag how r u it is not hamiltonian, it is visiting all vertices .b-a-c-d-e rt? plz ans 0 0 replyShare LeenSharma commented Nov 2, 2015 reply Follow flag A graph is said to be Hamiltonian if there exists an Hamiltonian Cycle. In Hamiltonian Cycle each vertex visit once and end with the same vertex it starts with. b-a-c-d-e is not a cycle.It is a path between b and e.if it is starts with b then it has to end with b.in that case cycle will be b-a-c-d-e-c-b.Here C visited 2 time. Hence it is not Hamiltonian Graph. 0 0 replyShare srestha commented Nov 3, 2015 reply Follow flag yes I missed that,thank u :) 1 1 replyShare Please log in or register to add a comment.
