Q9
What is a spanning tree of a graph?
A.
A subgraph that includes only leaf nodes.
B.
A subset of edges that forms a cycle.
C.
A tree where all nodes are leaves.
D.
A subgraph that includes all vertices and is connected without any cycles.
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board