in Graph Theory retagged by
406 views
0 votes
0 votes

Is this graph Euler?

in Graph Theory retagged by
406 views

1 Answer

1 vote
1 vote
Any graph has a $Euler\,path$ if the number of $odd$ degree vertices are $0\,or\,2$ and all the non-zero degree vertices belong the same component

For $Euler\,graph$ it should have a cyle i.e. number of odd degree vertices should be 0.

Here the number of odd degree vertices are 2. So, this is not a $Euler\,graph$.
edited by

4 Comments

You are definition is euler path but not euler cycle.
0
0

@Shaik Masthan i thought of euler graph as having path. Corrected it. Thanks

0
0

@Shaik Masthan , so it has Euler path but it is not a Euler graph?

 

0
0
Yes... note that parallel edges doesn't effect Hamilton graphs but they may effect euler graphs
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