Complete Graph Number of Edges

preview_player
Показать описание

Рекомендации по теме
Комментарии
Автор

You could also say the number of edges possible equals the nth triangle number where n = (v - 2) +1 where v is number of vertices. So for K5, n = 4. The fourth triangle number is 10.

amorfati
Автор

Thank you so much this helped me a lot

-dawn
Автор

Well.. i need the derivation of that formulae but your voice made me to watch the whole video😍

prateek
Автор

order kese find krty hain complete graph k 3se 11 tk tell me plz

haseenanazar
Автор

thank you very much but can you tell me how to find Total of degree

fatimafadhil
Автор

This formula cannot apply on all graphs...

samarazhar