With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
A. (V*(V-1))/2
B. (V*(V+1))/2
C. (V+1)C2
D. (V-1)C2
Answer:A
With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
A. (V*(V-1))/2 B. (V*(V+1))/2 C. (V+1)C2 D. (V-1)C2