A complete graph is a graph where every two vertices are joined by an edge as you see below. How many edges does have? (A complete graph with 1000 vertices)
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We have a theorem that states that the number of edges in any K n = ( 2 1 ) ( n ) ( ( n − 1 ) = 2 1 1 0 0 0 × 9 0 0 = 4 9 9 , 5 0 0 ; where n is the number of vertices .
Also, by looking at the graphs, you can deduce this formula. Let e = e d g e s
Notice, when n = 7 ⟹ e = 2 1
when n = 6 ⟹ e = 1 5 and
when n = 5 ⟹ e = 1 0 , by counting the number of edges from the graph. Make sure you don't count the same edge twice.