UTpaper

Free mock tests & test series

Question 161Asked in CIL MT Systems, 26 Mar 2017 (12:30 PM)

Maximum number of edges in a simple graph with 'n' vertices and 'k' components is:

  1. A(n − 2)(n − 1)/2 + 1
  2. B(n − k)(n − k + 1)/2
  3. Cn²
  4. Dn(n − 1)/2
Show answerHide answer

Correct answer: (B) (n − k)(n − k + 1)/2

From CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM)

This is question 161 of CIL MT Systems PYQ, 26 Mar 2017 (12:30 PM). 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.