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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
University of Zielona Góra
2021-02-01
|
| Schriftenreihe: | Discussiones Mathematicae Graph Theory |
| Schlagworte: | |
| Online-Zugang: | https://doi.org/10.7151/dmgt.2186 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|