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}
\]
Was this answer helpful?
0
0
Top TS PGECET Computer Science & Information Technology Questions