Question

What is the minimum number of edges possible in a directed graph having 6 vertices and no self-loops?

• A. 5
• B. 30
• C. 36
• D. 216

Hint:

For directed graphs without self-loops, use the formula \(n(n-1)\) to find edge count.

Answer 1

The Correct Option is B

In a directed graph with \(n\) vertices and no self-loops, maximum possible number of edges is \(n(n - 1)\).
\[ n = 6 \Rightarrow 6 \times (6 - 1) = 30 \text{ edges} \]