Teaching MPPSC Assistant Professor Mock Test Series 2025 Engineering Mathematics Graph Theory Graphs
A simple graph G with n-vertices is connected if the graph has
1
(n - 1) (n - 2)/2 edges
2
more than (n - 1) (n - 2)/2 edges
3
less than (n - 1) (n - 2)/2 edges
4
\(\Sigma^k_{i=1}C(n_i, 2)\) edges