GATE 2004-IT
October 5, 2023
Operating-Systems
October 5, 2023
GATE 2004-IT
October 5, 2023
Operating-Systems
October 5, 2023

GATE 2004-IT

Question 5

What is the maximum number of edges in an acyclic undirected graph with n vertices?

A
n – 1
B
n
C
n + 1
D
2n – 1
Question 5 Explanation: 
Maximum number of edges in an acyclic undirected graph = No. of vertices – 1
= n – 1
Correct Answer: A
Question 5 Explanation: 
Maximum number of edges in an acyclic undirected graph = No. of vertices – 1
= n – 1
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!