Transitive Digraph

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

See also

Digraph Topology, Transitive Reduction

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Transitive Digraph." From MathWorld--A Wolfram Web Resource.

Subject classifications