The maximum number of edges in an undirected disconnected graph with n vertices is (n-1)(n-2)/2. This is achieved by forming a complete graph with n-1 vertices and leaving one vertex isolated.
Conditions: The graph is undirected.; The graph is disconnected.; The graph has n vertices.
The maximum number of edges in an undirected disconnected graph with n vertices is (n-1)(n-2)/2. This is achieved by forming a complete graph with n-1 vertices and leaving one vertex isolated.
Conditions: The graph is undirected.; The graph is disconnected.; The graph has n vertices.
The maximum number of edges in an undirected simple graph with n vertices is n(n−1)/2. This maximum is achieved when the graph is a complete graph.
Conditions: The graph is undirected.; The graph is simple (no self-loops or multiple edges between the same pair of vertices).; The graph has n vertices.
The maximum number of edges in an undirected simple graph with n vertices is n(n−1)/2. This maximum is achieved when the graph is a complete graph.
Conditions: The graph is undirected.; The graph is simple (no self-loops or multiple edges between the same pair of vertices).; The graph has n vertices.