Question 1
Which statement best describes a spanning tree of a connected graph?
Question 2
A connected graph has $7$ vertices. How many edges does any spanning tree of this graph have?
Question 3
Which statement is always true for every connected graph?
Question 4
What is true about a spanning tree compared with the original connected graph?
Question 5
If a graph is already a tree, how many spanning trees does it have?
