A ___________ of a graph is a subgraph that is a tree and connects all vertices in the graph.
A) spanning tree
B) shorted path

Name: A ___________ of a graph is a subgraph that is a tree and connects all vertices in the graph. A) spanning tree B) shorted path
Brand: Quizplus
Rating: 4.9 (37 reviews)

Question

Quizplus · Accepted Answer

A spanning tree is defined as a subgraph that is a tree and connects all vertices in the graph. Therefore, this is the best choice. Shortest path does not necessarily connect all vertices and does not form a tree, so it is not a suitable choice.

A ___________ of a Graph Is a Subgraph That Is