Complete Graph

A complete graph is a graph where every two vertices are joined by an edge as you see below. How many edges does K 1000 K_{1000} have? (A complete graph with 1000 vertices)

497500 498500 100 0 2 1000^{2} 499500

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.

1 solution

Hana Wehbi
May 28, 2016

We have a theorem that states that the number of edges in any K n = ( 1 2 K_{n}= (\frac{1}{2} ) ( n ) ( ( n 1 ) (n)((n-1) = 1 2 \frac{1}{2} 1000 1000 × \times 900 900 = 499 , 500 499,500 ; where n is the number of vertices n \text{ is the number of vertices} .

Also, by looking at the graphs, you can deduce this formula. Let e = e d g e s e= edges

Notice, when n = 7 e = 21 n=7 \implies e=21

when n = 6 e = 15 n=6 \implies e =15 and

when n = 5 e = 10 n=5 \implies e=10 , by counting the number of edges from the graph. Make sure you don't count the same edge twice.

Pick two vertices we get edge AB=BA so 1000C2

<> <> - 3 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...