In graph theory terms, what is a tree?
A graph in which at least one vertex is connected by an edge to every other vertex.
A graph in which every vertex is connected by an edge to every other vertex.
A connected graph in which every edge is a bridge.
A connected graph in which no vertex has a degree higher than $2$2.
Which of the following statements about trees are true? Select all that apply.
The following questions relate to spanning trees.
Consider the following graphs.
Choose appropriate networks to find optimal solutions
Apply network methods in solving problems