home > q&a board > other > topic: euler circuit

Q BgQuestion:

Rookie
Karma Points: 0
Respect (100%):
posted by  ABBAS ALI on 2/16/2008 2:17:50 AM  |  status: Live  

Euler Circuit

Course Textbook Chapter Problem
Discrete Math N/A N/A N/A
Question Details:

AAnswers:

Answer Question
Oracle
Karma Points: 8,128
posted by jks777 on 2/16/2008 3:18:02 AM  |  status: Live
Asker's Rating: Lifesaver   
ABBAS ALI's comment:
"Thanks a lot"
Response Details:
An Euler circuit is a path where the path starts and ends at the same vertex, all of the vertices are hit, all edges are hit and no edge is repeated twice.  Here the direction is this:
 
d => a => b => c => f => i => h => g => d => e => h => f => e => b => d
 
A Hamilitonian cycle is like an Euler circuit in that every vertex is hit but none are reused except for the starting vertex.  A Hamilitonian Cycle does not exist here.
Mentor
Karma Points: 790
(o)
posted by sajid on 2/16/2008 7:13:32 AM  |  status: Live
Asker's Rating: Helpful   
ABBAS ALI's comment:
"Thanks"
Response Details:

From above clearly     deg(a)=2, deg(b)=4, deg(c)=2, deg(d)=4, deg(e)=4, deg(f)=4, deg(g)=2, deg(h)=4, deg(i)=2

     Since the degree of each vertex is even, and the graph has Euler Circuit
sajidscoropio
Answer Question
Ask New Question

Join Cramster's Community

Cramster.com brings together students, educators and subject enthusiasts in an online study community. With around-the-clock expert help and a community of over 100,000 knowledgeable members, you can find the help you need, whenever you need it. Join for free today » How Cramster is different than tutoring »

Need Help In

Useful Links