A directed graph 
is transitive if any three vertices 
such that edges 
imply 
. Unlabeled reflexive
transitive digraphs, equivalently preorders, correspond
to finite topologies and are called digraph
topologies (Harary and Palmer 1973, p. 261).
Transitive Digraph
See also
Digraph Topology, Transitive ReductionExplore with Wolfram|Alpha
References
Harary, F. and Palmer, E. M. "A Survey of Graphical Enumeration Problems." In A Survey of Combinatorial Theory (Ed. J. N. Srivastava). Amsterdam, Netherlands: North-Holland, pp. 259-275, 1973.Referenced on Wolfram|Alpha
Transitive DigraphCite this as:
Weisstein, Eric W. "Transitive Digraph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/TransitiveDigraph.html