Simple directed graph


Definition

"D is a simple digraph if the arcs of D are all distinct, and if there are no 'loops' (arcs of the form vv). Note that the underlying graph of a simple digraph need not be a simple graph ..." Introduction to Graph Theory by Robin J. Wilson page 22