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.


Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.