5. Prove that in a simple graph with a number if vertices and 
number of components can have maximum 
( n – m )( n – m + 1 ) number of edges.
number of components can have maximum ( n – m )( n – m + 1 ) number of edges. 5. Prove that in a simple graph with a number if vertices and number of components can have maximum ( n – m )( n – m + 1 ) number of edges.
Share