Graph Exponentiation and Neighborhood Reconstruction
Any graph G admits a neighborhood multiset (G) = {NG(x) | x ∈ V (G)} whose elements are precisely the open neighborhoods of G. We say G is neighborhood reconstructible if it can be reconstructed from (G), that is, if G ≅ H whenever (G) = (H) for some other graph H. This note characterizes neigh...
Kaydedildi:
| Yazar: | |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
University of Zielona Góra
2021-02-01
|
| Seri Bilgileri: | Discussiones Mathematicae Graph Theory |
| Konular: | |
| Online Erişim: | https://doi.org/10.7151/dmgt.2186 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|