Vidyalelo
Data Structure · Q128

Graphs

Programming · Data Structure · question 128

Q128

With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

A.
(V*(V-1))/2
Answer
B.
(V*(V+1))/2
C.
(V+1)C2
D.
(V-1)C2

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board