Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsMinimum spanning tree algorithms

Spanning tree

Properties of spanning trees

Report a typo

Spanning trees have tons of properties, most of which are essential to know for those who want to be experts in graph theory. If you are one of such people, find all the correct statements below:

Select one or more options from the list

An unweighted graph can have no spanning trees

An unweighted graph can have exactly one spanning tree

An unweighted graph can have more than one spanning tree

An unweighted graph can have at least two spanning trees with different number of edges

___

Create a free account to access the full topic