Question

A directed complete graph of n vertices contains __________.
Select one:
a. one arrow between each pair of distinct vertices
b. two arrows between each pair of distinct vertices
c. path between every two distinct vertices
d. n-1 arrows between each pair of distinct vertices
​

Answer 1

Answer:

Complete Graph

A graph in which every pair of vertices is joined by exactly one edge is called complete graph. It contains all possible edges. A complete graph with n vertices contains exactly nC2 edges and is represented by Kn.