in Graph Theory
225 views
0 votes
0 votes
Finda a graph with every vertex degree at least 2, and have only one perfext matching. (In Perfect matching all vertex are matched.)
in Graph Theory
225 views

1 Answer

0 votes
0 votes
Best answer
Yes there are such graphs.

O--------O------------O

|        /             /  |

|      /            /     |

|   /            O------O

O

 

try to draw this graph and find perfect matching .:
selected by

1 comment

Shall we generalize as two odd cycles sharing exactly one vertex have this property?? (i.e perfect matching)
0
0