303 views

1 Answer

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

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

|        /             /  |

|      /            /     |

|   /            O------O

O

 

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

Related questions

0 votes
0 votes
1 answer
1
Learner_jai asked Feb 27, 2017
743 views
In a village there are equal no of boys and girls of marriageable age.Each boy dates a certain no. of girls and each girl dates a certain number of boys,under what cond...
0 votes
0 votes
2 answers
2
yuuchan asked Jul 22, 2023
478 views
If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉