What would you like to understand?

The maximum number of edges in a strongly connected directed graph with n vertices is $n(n-1)$. This corresponds to a complete directed graph where every pair of distinct vertices has edges in both directions.

Conditions: The graph is directed.; The graph is strongly connected.; The graph has n vertices.

The maximum number of edges in a strongly connected directed graph with n vertices is $n(n-1)$. This corresponds to a complete directed graph where every pair of distinct vertices has edges in both directions.

Conditions: The graph is directed.; The graph is strongly connected.; The graph has n vertices.

An undirected connected graph with n vertices has at least n-1 edges. This minimum is achieved when the graph forms a tree structure.

Conditions: The graph is undirected.; The graph is connected.; The graph has n vertices.

An undirected connected graph with n vertices has at least n-1 edges. This minimum is achieved when the graph forms a tree structure.

Conditions: The graph is undirected.; The graph is connected.; 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.

A strongly connected directed graph with n vertices has at least n edges. This minimum is achieved when the graph forms a single directed cycle.

Conditions: The graph is directed.; The graph is strongly connected.; The graph has n vertices.

A strongly connected directed graph with n vertices has at least n edges. This minimum is achieved when the graph forms a single directed cycle.

Conditions: The graph is directed.; The graph is strongly connected.; 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 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.