1. How many different minimum spanning trees are there in an undirected graph of three vertices and three edges? 2. An undirected graph must have a cycle if a. any vertex can be reached from some...

1.
How many different minimum spanning trees are there in an undirected graph

of three vertices and three edges?

2.
An undirected graph must have a cycle if

a.
any vertex can be reached from some other vertex.

b.
the number of paths is greater than the number of vertices.

c.
the number of edges is equal to the number of vertices.

d.
the number of paths is less than the number of edges.