Show that the simple graph G with n vertices is connected if it has more than (n-1)(n-2)/2 edges

[@ManojKumar-pv6yo]

Well explained sir 👍

[@blueart7173]

Dheivameyyyyyy🙏🏻🙏🏻🙏🏻

[@PoovarasiD-mv5ut]

Super explain sir nalaiku enaku exam sir

[@DhivyaSivakumar-to7vc]

2nd page la C(k,2)....ithala C kku enna meaning sir

[@4G_Silver_Academy_தமிழ்]

Connections

[@DhivyaSivakumar-to7vc]

Sir please reply pannuga 😭😭😭😭

[@4G_Silver_Academy_தமிழ்]

Connected Graphs