A connected graph has an Eulerian trail but not an Eulerian circuit. What must be true about the number of its vertices of odd degree?
A connected graph has an Eulerian trail but not an Eulerian circuit.…
Written by
in
Written by
in
A connected graph has an Eulerian trail but not an Eulerian circuit. What must be true about the number of its vertices of odd degree?
Leave a Reply