A graph G is transitive if any three vertices (x, y, z) such that edges (x, y), (y, z) element G imply (x, z) element G. Unlabeled transitive digraphs are called digraph topologies.

digraph topology | transitive reduction