# Math Help - Graph Theory

1. ## Graph Theory

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.

2. Originally Posted by skiing64
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: ${N \choose 2}=\frac {N(N-1)}{2}$.

If not, please define the terms used in this question.

3. not directed is not having arrows pointing in a direction but how do you prove that is correct?

4. In a simple graph, any two vertices determine at most one edge.
Therefore, the maximum number of edges on N vertices equals N choosing 2.

5. Thanks I was going about that the right way then