A graph is transitive if any three vertices such that edges imply . Unlabeled transitive digraphs are called digraph topologies.

# Transitive Digraph

## See also

Digraph Topology, Transitive Reduction## Explore with Wolfram|Alpha

## Cite this as:

Weisstein, Eric W. "Transitive Digraph."
From *MathWorld*--A Wolfram Web Resource. https://mathworld.wolfram.com/TransitiveDigraph.html