menu
home
Home
search
Search
people
About Us
exit_to_app
Login
home
Home
search
Search
people
About Us
exit_to_app
Login
Practicing for Minimum Spanning Tree of Algorithms
Questions 1 of 8
Q. Which of the following is false in the case of a spanning tree of a graph G?
It is tree that spans G
It is a subgraph of the G
It includes every vertex of the G
It can be either cyclic or acyclic
Submit
lock
Login
person
Signup
Email
Password
Name
Email
Password
Confirm Password