McqMate
| Q. |
Which of the following is false in the case of a spanning tree of a graph G? |
| A. | it is tree that spans g |
| B. | it is a subgraph of the g |
| C. | it includes every vertex of the g |
| D. | it can be either cyclic or acyclic |
| Answer» D. it can be either cyclic or acyclic | |
| Explanation: a graph can have many spanning trees. each spanning tree of a graph g is a subgraph of the graph g, and spanning trees include every vertex of the gram. | |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet