ExamCompetition Your Success, Our Mission
Login Register
Question discussion

In a path-graph having ‘n’ vertices, where ‘n’ > 2, ______ is the number of vertices with degree 2.

3693Medium DSSSB TGT Computer Science 0 replies

In a path-graph having ‘n’ vertices, where ‘n’ > 2, ______ is the number of vertices with degree 2.

  • A3
  • Bn − 2
  • C2
  • D0
Correct answer: B

Explanation

In a path graph the two end vertices have degree 1 and all other n − 2 vertices have degree 2.
Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!