Question

What is the maximum number of edges for an undirected graph? A directed graph?

Answer 1

Answer:

For undirected graph n(n-1) for directed graph $\frac{n(n-1)}{2}$

Explanation:

The maximum number of edges for a undirected graph is given by $n(n-1)$, where n is number of vertices

The maximum number of edges in directed graph is given by $\frac{n(n-1)}{2}$, where n is number of vertices

The maximum number of edges is greater in undirected graph than directed graph