Problem
COM-B1-M12-P012 Set 3. Connectedness
#12
★★☆☆☆ Level 2 of 5
What is the minimum number of edges needed for a graph on \(12\) vertices to be connected?
A connected graph on \(n\) vertices has at least \(n-1\) edges.
The minimum is \(12-1=11\). It is achieved by a path on \(12\) vertices.
A lower bound and an example are both needed.