(A) n(n–1)/2 
(B) n(n+1)/2 
(C) 2n 
(D) 2n
Answer A.
Explanation.
A complete digraph is a directed graph  in which every pair of distinct vertices is
connected by a pair of unique edges
Triangle  need
three edges to connect all nodes them selves..
Rectangle need 6 edges to connect all nodes
themselves.
Pentagon. Needs 10 edges to connect all nodes themselves.
So n(n-1)/2.

 
No comments:
Post a Comment
Note: only a member of this blog may post a comment.