Intermediate
Discrete Mathematics & Math
Q66 / 100
In a connected simple graph with 7 vertices, what is the minimum number of edges required for the graph to remain connected?
Correct! Well done.
Incorrect.
The correct answer is B) 6
B
Correct Answer
6
Explanation
A connected graph on n vertices needs at least n-1 edges, achieved exactly by a tree. For n=7, the minimum is 6 edges; fewer would disconnect the graph (it would form a forest with multiple components).
Progress
66/100