Question 15Asked in Bihar STET Paper 2 Computer Science (Class 11-12), 12 Sep 2023, Shift 2 + 1 more paper

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

Show answerHide answer

Correct answer: (B) n - 1

Explanation

A spanning tree on n vertices is a tree, and every tree with n vertices has exactly n - 1 edges, so the minimum (and only) count is n - 1.

From Bihar STET Paper 2 Computer Science (Class 11-12) PYQ, 12 Sep 2023, Shift 2

This is question 15 of Bihar STET Paper 2 Computer Science (Class 11-12) PYQ, 12 Sep 2023, Shift 2. 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.