GATE 2004-IT
October 5, 2023Operating-Systems
October 5, 2023GATE 2004-IT
| Question 5 |
What is the maximum number of edges in an acyclic undirected graph with n vertices?
| n – 1 | |
| n | |
| n + 1 | |
| 2n – 1 |
Question 5 Explanation:
Maximum number of edges in an acyclic undirected graph = No. of vertices – 1
= n – 1
= n – 1
Correct Answer: A
Question 5 Explanation:
Maximum number of edges in an acyclic undirected graph = No. of vertices – 1
= n – 1
= n – 1