Can an undirected graph with n vertices and n - 1 edges not be connected?

1
votes

I know that for an undirected graph with n vertices the minimum number of edges it must have for it to be connected is n - 1. However, if a graph has n vertices and n - 1 edges, is it always connected?

1
graphundirected-graph

1 Answers

3
votes

no thats not the case, example:

enter image description here