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
Which of the following is false in the case of a spanning tree of a graph G?
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
Which of the following is false in the case of a spanning tree of a graph G?
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!