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.
I tiakina i:
| Kaituhi matua: | |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Wiley
1992-01-01
|
| Rangatū: | International Journal of Mathematics and Mathematical Sciences |
| Ngā marau: | |
| Urunga tuihono: | http://dx.doi.org/10.1155/S0161171292000978 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|