Q15.Marks: +2.0UGC NET Paper 2: Computer Science 11 March 2023
Consider the Graph below:
How many spanning trees can be found?
1.10
2.5
3.9
4.8✓ Correct
Solution
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).