Question

Prove that if a graph has exactly twi vertices of odd degree , there must be a path joining these two vertices

Answer 1

Step-by-step explanation:

If a graph (connected or disconnected) has exactly two vertices of odd degree then there must be a path joining these vertices. Proof. Let X be a graph that has exactly two vertices, say u and v of odd degree. ... But, then v is the only other vertex in X of odd degree and hence v lies in the component C.

It's your choice, if u want to mark it as Brainliest or not.