466 views
0 votes
0 votes
A graph G has k isolated vertices and n + k vertices. The maximum number of edges graph G can have?

a) n(n-1) b)n(n-1)/2) c) n(n-k+1)/2 d) n(n+k-1)/2

1 Answer

0 votes
0 votes
Total number of vertices n+k

Number of isolated vertex k

Total components k+1,

Maximum number of edges  0*K (For k isolated vertex) n(n-1)/2 for reaming 1 component

Total Maximum Edges $\frac{(n*(n-1))}{2}$

Option B

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
3 answers
2
2 votes
2 votes
1 answer
3
Sanjay Sharma asked Dec 9, 2016
925 views