0 votes 0 votes 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 Gate Fever asked Jan 8, 2019 Gate Fever 214 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Navneet Kalra commented Jan 8, 2019 reply Follow Share 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) 1 votes 1 votes Gate Fever commented Jan 8, 2019 reply Follow Share oh yes! it was so easy, i got confused! 0 votes 0 votes Please log in or register to add a comment.