rc test series

Question

consider a simple graph G with k components.If each component has n1,n2,.....nk vertices,then the maximum number of edges in G is

Comments

maxmium possible edges with n1 will be n1C2 ,for n2 will be n2C2 for n3 will be n3C3 ...and so on

so total edges will be n1C2+n2C2+n3C2+n4C2+n5c2....+nkC2

=summation(n(i)C2)(from i=1 to k)

---

oh yes!

it was so easy, i got confused!