1.

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» E.


Discussion

No Comment Found