Abstract
In this paper a sort of end concept for directed graphs is introduced and examined. Two one-way infinite paths are called equivalent iff there are infinitely many pairwise disjoint paths joining them. An end of an undirected graph is an equivalence class with respect to this relation. For two one-way infinite directed paths U and V define: (a) U⩽ V iff there are infinitely many pairwise disjoint directed paths from U to V; (b) U ∼ V iff U ⩽ V and V ⩽ U. The relation ⩽ is a quasiorder, and hence ∼ is an equivalence relation whose classes are called ends. Furthermore, ⩽ induces a partial order on the set of ends of a digraph. In the main section, necessary and sufficient conditions are presented for an abstract order to be representable by the end order of a digraph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
