UTpaper

Free mock tests & test series

Question 128Asked in DSSSB TGT Computer Science, 24 Jun 2023, Shift 3 (4:30 PM)

In a path-graph having 'n' vertices, where 'n' > 2, is the number ofvefiices with degree 2.

  1. A3
  2. Bn − 2
  3. C2
  4. D0
Show answerHide answer

Correct answer: (B) n − 2

Explanation

In a path graph the two end vertices have degree 1 and every other vertex has degree 2, so n − 2 vertices have degree 2.

From DSSSB TGT Computer Science PYQ, 24 Jun 2023, Shift 3 (4:30 PM)

This is question 128 of DSSSB TGT Computer Science PYQ, 24 Jun 2023, Shift 3 (4: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.