Consider the Graph below:

F1 Savita ENG 22-12-23 D5

How many spanning trees can be found?

This question was previously asked in
UGC NET Computer Science (Paper 2) 11 March 2023 Official Paper
View all UGC NET Papers >
  1. 10
  2. 5
  3. 9
  4. 8

Answer (Detailed Solution Below)

Option 4 : 8
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
10.8 K Users
50 Questions 100 Marks 60 Mins

Detailed Solution

Download Solution PDF

The correct answer is 8

Key PointsSubgraph: A subgraph is a type of graph wherein its edges and vertices are chosen as subsets from the original graph.

Spanning Tree: A spanning tree is a specific subgraph, possessing all the vertices from the original graph, and is structured as a tree (not make any loop).

F1 Savita ENG 22-12-23 D5

Here possible spanning tree is:

F1 Savita ENG 22-12-23 D06

Latest UGC NET Updates

Last updated on Jun 12, 2025

-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

More Spanning Tree Questions

More Graphs/Spanning Tree and Shortest Paths Questions

Get Free Access Now
Hot Links: teen patti 3a teen patti vip teen patti plus teen patti classic