If complete graph have 'n' nodes, then it will have how many edges?
Show answerHide answer
Correct answer: (A) n(n − 1)/2
Explanation
Each of the n nodes connects to the other n − 1. Each edge is then counted twice, so there are n(n − 1)/2 edges.
Correct answer: (A) n(n − 1)/2
Explanation
Each of the n nodes connects to the other n − 1. Each edge is then counted twice, so there are n(n − 1)/2 edges.
This is question 131 of DSSSB PGT Computer Science PYQ (Technical), 11 Jul 2021. See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.