Register

Doubt Perfext Matching

558 views
0 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.)

1 Answer

Best answer
0 0 votes
Yes there are such graphs.

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

|        /             /  |

|      /            /     |

|   /            O------O

O

 

try to draw this graph and find perfect matching .:
• selected by
Voting & Accepting an answer helps improve the community
← Previous · ME = CompilerNext → · Is there SR conflict...
← Previous in category · Doubt: Graph TheoryNext in category → · GATE CSE 1990 | Ques...
Position:
Show:

Related questions

0 0 votes
2 answers 2 answers
1.3k
1.3k views
yuuchan asked Jul 22, 2023
1,279 views
Ace workbook: If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____
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⌉
1 1 vote
2 2 answers
1.6k
1.6k views
Gupta731 asked Jan 2, 2019
1,560 views
Gateforum Test Series: Graph Theory - Graph Matching
4 4 votes
1 1 answer
1.3k
1.3k views
Prince Sindhiya asked Dec 21, 2018
1,296 views
Zeal Test Series 2019: Graph Theory - Graph Matching
0 0 votes
0 0 answers
577
577 views
sripo asked Sep 28, 2018
577 views
Can Null Graph be a valid Matching
Definition of valid matching says that if every vertex is incident with atmost one vertex then it is a matching but I have seen coaching material note which includes null...