Ask your own question, for FREE!
Discrete Math 51 Online
OpenStudy (bee_see):

(a) Explain why G does not have an Eulerian circuit. (b) By adding exactly three new edges to G, form a new simple graph H that does have an Eulerian circuit. (c) Find an Eulerian circuit in H. (d) Find a cycle decomposition of H

OpenStudy (bee_see):

OpenStudy (bee_see):

I'm pretty sure that for a, the answer is no because there are odd degrees, correct?

OpenStudy (bee_see):

for b, I have...added the edges like ths: |dw:1447447879863:dw|

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!