Unordered Love in infinite directed graphs

Abstract

A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.

Keywords

• digraph
• projective plane
• friendship graph.