Krishna Janmashtami Mega Sale (24-26 Aug) 🪈😍 CAT courses at just ₹ 1199 onwards. Enroll now
Edit MetaData
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:
Login to your Cracku account.
Enter Valid Email
Follow us on
Incase of any issue contact support@cracku.in
Boost your Prep!
Day-wise Structured & Planned Preparation Guide
By proceeding you agree to create your account
Free CAT Schedule PDF will be sent to your email address soon !!!
Join cracku.in for Expert Guidance.