Q. Which of the following is false in the case of a spanning tree of a graph G? (Solved)
1. it is tree that spans g
2. it is a subgraph of the g
3. it includes every vertex of the g
4. it can be either cyclic or acyclic
- d. it can be either cyclic or acyclic