Answer:
For undirected graph n(n-1) for directed graph [tex]\frac{n(n-1)}{2}[/tex]
Explanation:
The maximum number of edges for a undirected graph is given by [tex]n(n-1)[/tex], where n is number of vertices
The maximum number of edges in directed graph is given by [tex]\frac{n(n-1)}{2}[/tex], where n is number of vertices
The maximum number of edges is greater in undirected graph than directed graph
