Question 20
An undirected graph has 300 edges. What is the minimum number of vertices it must have?
An undirected graph has 300 edges. What is the minimum number of vertices it must have?
Correct answer: 25
Question 20 of 25 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) End Term paper sat on 31 Aug 2025, in the May 2025 term (IIT M DIPLOMA AN EXAM QDD3 31 Aug 2025). It carries 4 marks.