Let n>= 3 be an integer. Calculate the number of edges in Kn
Follow Math Help Forum on Facebook and Google+
$\displaystyle K_n$ is the complete graph of order $\displaystyle n$. There is an edge between any two vertices. So $\displaystyle {n} \choose {2}$.
So, n(n-1)/2 =3
Originally Posted by maptorren So, n(n-1)/2 =3 If n=3, then yes. If n=10, then $\displaystyle |E|=45$.
View Tag Cloud