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

Question

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?

score 3 · Answer 1 · answered Dec 11 '15 at 15:36

3

no thats not the case, example:

answered Dec 11 '15 at 15:36

apomene

14,282
9
46
72

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

1 Answers1