Let suppose the For the complete graph
Each vertex will (n-1) vertex is connected to it.
Now think
Vertices |
45 |
44 |
... |
|
|
|
|
|
|
|
|
|
|
Removing Edges
(it will removed from the total edges)
|
44 |
43 |
.. |
|
|
|
|
|
|
|
|
|
|
Resulting Component
|
2nd |
3rd |
.. |
|
|
|
|
|
|
|
|
|
15th |
Here the we need the 15th component .
We know that that total 45 Vertices of edges is equal to n(n-1)/2 which is equal to the 990 edges
Now After each addition of component , we have to remove the edges .
we will us Sum of the AP
a1 =44 and d=-1
note that on removing the 44 edges this will resulting into two component
so for the sequence we need to go only for 14 sequence not for the 15 ,On the 14th sequence we will get the 15th component
a14= 44+(13)(-1)
a14= 31
So , S14 = 14/2( 2(44) + 13(-1))
S14= 525
Answer-> 990 – 525 = 465