retagged by
13,156 views
2 votes
2 votes
retagged by

1 Answer

2 votes
2 votes

Complete graph Kn = nC2 edges

Cycle graph Cn = n edges

Wheel graph Wn= 2n edges

Bipartite  graph Km,n = mn edges

Hypercube graph Qn = 2n-1⨉n edges

Related questions

0 votes
0 votes
1 answer
1
1 votes
1 votes
0 answers
2
Piyush Kapoor asked Oct 14, 2015
1,070 views
I am unable to get this logic since in both of these algorithms we need to have a record of future requirement of the processes so then why is it that resource allocation...
0 votes
0 votes
1 answer
3
0 votes
0 votes
2 answers
4
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⌉