I have been trying to find out the maximum number of edges in a indirect graph with N vertices and how to prove it without any luck, any help would be greatly appreciated.
I have been trying to find out the maximum number of edges in a indirect graph with N vertices and how to prove it without any luck, any help would be greatly appreciated.
Not sure what is meant by indirect graph.
Do you mean a simple nondirected graph?
If so the answer is quite simple: $\displaystyle {N \choose 2}=\frac {N(N-1)}{2}$.
If not, please define the terms used in this question.