UTpaper

Free mock tests & test series

Question 100Asked in BPSC TRE 3.0 (2024) Computer Science Class 11-12

How many edges does a spanning tree of a graph with N vertices have?

  1. AN
  2. BN − 1
  3. CN(N − 1)/2
  4. DMore than one of the above
  5. ENone of the above
Show answerHide answer

Correct answer: (B) N − 1

Explanation

A spanning tree connects all N vertices with no cycle, so it has exactly N − 1 edges.

From BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper

This is question 100 of BPSC TRE 3.0 (2024) Computer Science Class 11-12 — Previous Year Paper. 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.