How many edges are present in a spanning tree containing 25 vertices?

Options

  • A. 24
  • B. 25
  • C. 26
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

A. 24

Detailed Explanation

For every tree with N vertices, the number of edges is exactly N - 1. Therefore, a spanning tree containing 25 vertices has 25 - 1 = 24 edges. A spanning tree connects all vertices while avoiding cycles. This formula is useful for quickly solving numerical questions: simply subtract one from the number of vertices.