Which of the following is false in the case of a spanning tree of a graph G?
Posted: Wed Jul 13, 2022 6:16 pm
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
b) It is a subgraph of the G
c) It includes every vertex of the G
d) It can be either cyclic or acyclic