A tree T is called a spanning tree of graph G if T is a subgraph of G such that V(T) = V(G), that is, all the vertices of G are in T.

Name: A tree T is called a spanning tree of graph G if T is a subgraph of G such that V(T) = V(G), that is, all the vertices of G are in T.
Brand: Quizplus
Rating: 4.9 (40 reviews)

Question

Quizplus · Accepted Answer

The Answer of A tree T is called a spanning tree of graph G if T is a subgraph of G such that V(T) = V(G), that is, all the vertices of G are in T.

A Tree T Is Called a Spanning Tree of Graph