Unordered Love in infinite directed graphs

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.

Bibliographic Details
Main Author: Peter D. Johnson
Format: Article
Language:English
Published: Hindawi Limited 1992-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Subjects:
Online Access:http://dx.doi.org/10.1155/S0161171292000978