1.

A directed complete graph of n vertices contains __________.

A. one arrow between each pair of distinct vertices
B. two arrows between each pair of distinct vertices
C. n-1 arrows between each pair of distinct vertices
D. path between every two distinct vertices
Answer» B. two arrows between each pair of distinct vertices


Discussion

No Comment Found