Topics: Digraph - Graph Theory


A complete digraph is a digraph where, between every pair of vertices, there exists an arc in both directions. A complete digraph must not have any loops.

A complete digraph is denoted with , where is the number of vertices.

All complete digraphs are symmetric, but not all symmetric digraphs are complete.

Number of Vertices and Arcs

In a complete digraph with vertices, there will be arcs.

Every vertex in a complete digraph will have (see external and internal degrees).