🧑🎓Join CAT VARC/DILR/Quant Mastery 3 months batch starting soon!
Edit MetaData
A simple graph (a graph without parallel edge or loops) with n vertices and k components can have at most
n edges
(n - k) edges
(n - k) (n - k + 1) edges
(n - k) (n - k + 1)/2 edges
Create a FREE account and get:
Login to your Cracku account.
Follow us on
Incase of any issue contact support@cracku.in
Boost your Prep!
Detailed syllabus & Topic-wise Weightage
By proceeding you agree to create your account
Free CAT Syllabus PDF will be sent to your email address soon !!!