Beginner
Discrete Mathematics & Math
Q10 / 100
What is a tree in graph theory?
Correct! Well done.
Incorrect.
The correct answer is B) A connected, undirected graph with no cycles — equivalently, a connected graph with n-1 edges for n vertices
B
Correct Answer
A connected, undirected graph with no cycles — equivalently, a connected graph with n-1 edges for n vertices
Explanation
Trees are minimally connected graphs. Any two vertices are connected by exactly one path. Rooted trees have a designated root with parent-child relationships. Spanning trees connect all vertices of a graph.
Progress
10/100