in Graph Theory
573 views
2 votes
2 votes
Draw a eular graph which is not hamiltonian
in Graph Theory
by
573 views

1 Answer

4 votes
4 votes

3 Comments

how r u it is not hamiltonian, it is visiting all vertices .b-a-c-d-e      rt? plz ans
0
0

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
yes I missed that,thank u :)
1
1
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true