A conjecture on the reconstruction of graphs from metric balls of their vertices

DOI10.1016/j.disc.2007.09.027zbMath1142.05056OpenAlexW1995432558WikidataQ123149540 ScholiaQ123149540MaRDI QIDQ2470472

Vladimir I. Levenshtein

Publication date: 14 February 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.027

zbMATH Keywords

graph reconstructionlabelled graphsneighbourhoods of vertices

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Reconstructing trees from digitally convex sets

Cites Work

• Reconstruction of a graph from 2–vicinities of its vertices
• Unnamed Item
• Unnamed Item

This page was built for publication: A conjecture on the reconstruction of graphs from metric balls of their vertices