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.
Saved in:
| Main Author: | Peter D. Johnson |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1992-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171292000978 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Antipodal graphs and digraphs
by: Garry Johns, et al.
Published: (1993-01-01) -
Key performance indicators in technology firms using generalized fermatean neutrosophic competition graph
by: Wadei Faris AL-Omeri, et al.
Published: (2024-11-01) -
A digraph equation for homomorphic images
by: Robert D. Girse, et al.
Published: (1986-01-01) -
On strongly connected Markov graphs of maps on combinatorial trees
by: Sergiy Kozerenko
Published: (2025-03-01) -
The Clique-Width of Minimal Series-Parallel Digraphs
by: Frank Gurski, et al.
Published: (2025-05-01)