🧑🎓Join CAT VARC/DILR/Quant Mastery 3 months batch starting soon!
Edit MetaData
Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of componentsin the resultant graph must necessarily lie between.
k and n
k - 1 and k + 1
k - 1 and n - 1
k + 1 and n - k
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 !!!