The minimum number of edges in a spanning tree of a connected graph with "n"…

Bihar STET · PGT (Paper 2) · Computer Science · 2025

The minimum number of edges in a spanning tree of a connected graph with "n" vertices is:

  1. A.

    n

  2. B.

    n - 1

  3. C.

    n + 1

  4. D.

    n(n-1)/2

Attempted by 961 students.

Show answer

Correct answer: B

The worked solution is available to enrolled students.

Explore the full course: Bihar Stet Paper Ii Computer Science

Loading lesson…