Basic Doubt

Question

Statement :

"Every Euler Graph is a simple graph"

 

Please comment whether it is true always or need not to be.

( My concern is whether multi edge or self loop is allowed in euler graph or not i. e non-simple graph allowed or not )

Comments

yes, that makes your work easier !

---

Brother, now i got ur whole point.

1. Converting euler graph into simple may or may not preserve the eulerian property But Hamiltonian does.

2. Hence, converting in case of Hamiltonian make things easier as it does not have any "sufficient" check for graph to be Hamiltonian.


any reference or link where i can find how to exactly convert ?

or its just a process of removing multiedges if present between two nodes ?

 

@Shaik Masthan 

thanx :)

---

simply remove the parallel edges and self loops, then it is simple graph only !