A spanning tree for a graph G is .

To fill in the blank of the statement “a spanning tree for the graph G is____”.

A spanning tree for a graph G isa subgraph of G such that reformed as a tree containing all the vertices of the graph.

Given information:

The statement is given as “A spanning tree for a graph G is _____.”

In a normal graph we can observe circuits. But in some occasions, we have to face some difficulties with these circuits.

Hence, we form a subgraph/ a tree of the graph G including all the vertices and missing the circuits without disconnecting the graph. These trees are called as spanning trees.