Question

Q. 4. Show that the maximum number of edgesin a simple graph with n vertices
is ( 1)
2
n n - ? 5

Answer 1

Answer:

The maximum  number of edges in a simple graph with n vertices is

$\frac{n(n-1)}{2}$

Step-by-step explanation:

Let G be a simple graph with n vertices.

The maximum number of edges in G

= The total number of ways of selecting 2 vertices among n vertices

$=n_{C_{2}}$

$=\frac{n(n-1)}{1.2}$

$=\frac{n(n-1)}{2}$