Types Of Digraphs

Balanced Digraphs: A digraph D is said to be a balanced digraph or an isograph if d (v) = d–(v) for every vertex v of D.

Regular Digraph: A balanced digraph is said to be regular if every vertex has the same in-degree and out-degree as every other vertex.

Complete Digraphs: A complete undirected graph was defined as a simple graph in which every vertex is joined to every other vertex exactly by one edge.

Complete Symmetric Digraph: A complete symmetric digraph is a simple digraph in which there is exactly one edge directed from every vertex to every other vertex (see Fig. 8.9).

Complete Asymmetric Digraph: A complete asymmetric digraph is an asymmetric digraph in which there is exactly one edge between every pair of vertices (see Fig. 8.6).