1
$\begingroup$

For this graph, do Eulerian circuit path exist or not? Basic definition A Euler circuit is a circuit that uses every edge of a graph exactly once. A Euler circuit starts and ends at the same vertex.

enter image description here

As far as i know the B follows Eulerian circuit path while A is not, is it correct?

$\endgroup$
1
$\begingroup$

None of those graphs have an Eulerian circuit because they both have vertices of odd degree: $c,f$ in $A$ and $g,h$ in $B$.

$\endgroup$
  • $\begingroup$ Can you please check this question, its also helpful for me $\endgroup$ – Aadnan Farooq A Dec 10 '15 at 16:58
1
$\begingroup$

No, you can't, its semi eulerian, if in a connected graph it is possible to traverese all edges exactly once and go back to the starting vertex, then its eulerian, a connected graph is eulerian iff all vertex degree is even.

$\endgroup$
  • $\begingroup$ Can you please check this question, its also helpful for me $\endgroup$ – Aadnan Farooq A Dec 10 '15 at 16:58
1
$\begingroup$

both of these graphs are not eulerian. I explained why not.

$\endgroup$
  • $\begingroup$ can we say Figure B as Eulerian? $\endgroup$ – Aadnan Farooq A Dec 10 '15 at 16:41

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.