Finite directed graph
Under the loop-free simple convention, a finite digraph has a finite vertex carrier and an ordered-pair edge set without loops or duplicate same-direction edges.
atlas-finite-directed-graph · canonical_mko
Finite directed graph
This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.
Catalogue presentation and source-binding data