A spanning tree of a graph is a tree with that always has which of the following properties?
a) It includes some of the edges and some of the vertices of the graph.
b) It includes all of the edges and some of the vertices of the graph.
c) It includes some of the edges and all of the vertices of the graph.
d) It includes all of the edges and all of the vertices of the graph.
e) none of the above
c) It includes some of the edges and all of the vertices of the graph.
You might also like to view...
In a token ring network, a device waiting to transmit
a. must wait until it receives a busy token b. must wait until it receives a free token c. can transmit only when it is the active monitor d. can transmit only when it is the standby monitor
What is the "POP before SMTP" authentication method and how is it used to defend against improper use of an SMTP server?
What will be an ideal response?