Maximum Number of Arcs in Digraph/Examples/Order 3

Examples of Use of Maximum Number of Arcs in Digraph

Let $D$ be the digraph of order $3$ whose edge set $E$ is as large as possible.

Then the number of arcs of $G$ is given by:

$\size E = 6$

Proof

By Maximum Number of Arcs in Digraph:

$\size E = 3 \times \paren {3 - 1} = 6$

Sources

• 1977: Gary Chartrand: Introductory Graph Theory ... (previous) ... (next): Chapter $1$: Mathematical Models: $\S 1.5$: Directed Graphs as Mathematical Models: Problem $33 \ \text {(a)}$