Show that: (a) If G is a graph that has a bridge e E(G) and...

 

Transcribed Image Text:

Show that: (a) If G is a graph that has a bridge e € E(G) and all its vertices has an odd degree, then all perfect matchings of G contains e. (b) Deduce that if G is 3-regular and G has a bridge, then X(G) = 4 Show that: (a) If G is a graph that has a bridge e € E(G) and all its vertices has an odd degree, then all perfect matchings of G contains e. (b) Deduce that if G is 3-regular and G has a bridge, then X(G) = 4

Answer rating: 100% (QA)

Solution Given Hence we have given that G is a graph To ShowIf G has a bridge G and an its ve... View the full answer