How do you know if a connected undirected graph does not contain a cycle?
A connected undirected graph that has EXACTLY n-1 edges, with n being the number of nodes in the graph, cannot contain a cycle.
none
A connected undirected graph with 17 nodes has 20 edges. Is it a spanning tree? If so, why?
A) No.
B) Not enough information is presented to reach a conclusion.
C) Yes; any connected but undirected graph is a spanning tree.
D) Yes; a spanning tree is a connected graph with at least (N + 1) edges.
How do you get the minimum spanning tree?
Prim's Algorithm
What is a spanning tree?
A.graph that has two cycles
B.graph that has one cycle
C.graph that has no cycle
D.none of the above
What is a Spannning three?
A. Connected graph
B. Undirected graph without cycles
C. All the above.
What results from a Depth-First Search?
A) 2-3 Tree
B) Binary Tree
C) Balanced Binary Tree
D) Spanning Tree
A connected __ digraph with n vertices and ___ n-1 degrees ___ a cycle
a.directed, exactly, must contain ;undirected, more than, cannot contain
b.undirected, more than, must contain ;undirected, exactly, cannot contain
c.undirected, exactly, cannot contain ;directed, more than, must contain
d.directed, more than, must contain ;directed, exactly, cannot contain
e. None of the above
What aglorithm is used to find the minimum spanning tree for a graph?
A. Depth First Search
B. Bubble Sort
C. Dijkstra's Algorithm
D. Prim's Algorithm
Which of the following is NOT a way to find a spanning tree?
A. DFS
B. BFS
C. Prim's
D. Dijkstra's
Which of the following are correct concerning spanning trees?
A. all trees are graphs, but not all graphs are trees, and it is a connected, undirected graph without cycles
B. all trees are not graphs, but all graphs are trees, and it is a connected, undirected graph without cycles
C. all trees are graphs, but not all graphs are trees, and it is an unconnected, undirected graph without cycles
D. all trees are not graphs, but all graphs are trees, and it is an unconnected, undirected graph without cycles
A graph with that is not connected will not have a spanning tree?
A connected undirected graph that has n vertices and exactly n - 1 edges must contain at least one cycle.
