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...
| Published in: | Discussiones Mathematicae Graph Theory |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2021-02-01
|
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2186 |