Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
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.
Given n nodes, if every node is connected to every other node (except itself) the number of connections will be n*(n-1)/2
How does one prove this ?
This is not a homework question. I have been away from CS text books for long and have forgotten the theory on how to prove this.
And one more solution, combinatorial:
The problem is equivalent to the number of possible pairs of nodes in the graph, i.e.: