📢 Starts today 👉 Join CAT 2 months crash course
Maximum number of edges in a n—node undirected graph withoutself-loops is
$$n^{2}$$
$$\frac{n(n-1)}{2}$$
n-1
$$\frac{n(n+1)}{2}$$
Create a FREE account and get:
Ask doubts feature is currently unavailable for you. You can reach us at support@cracku.in for any further details/doubts.
Boost your Prep!
