Q. A directed complete graph of n vertices contains __________. (Solved)
1. one arrow between each pair of distinct vertices
2. two arrows between each pair of distinct vertices
3. n-1 arrows between each pair of distinct vertices
4. path between every two distinct vertices
- a. one arrow between each pair of distinct vertices