Reconstruction of a graph from 2–vicinities of its vertices

DOI10.1016/j.endm.2005.07.065zbMath1179.05073OpenAlexW2173150961MaRDI QIDQ3439285

Sergey Molodtsov, Elena V. Konstantinova, Vladimir I. Levenshtein, Eugene Konstantinov

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/j.endm.2005.07.065

zbMATH Keywords

girthreconstruction algorithmgraph reconstructionneighbourhood2-vicinitygraph of neighbourhood

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs ⋮ A conjecture on the reconstruction of graphs from metric balls of their vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A congruence theorem for trees
• Reconstruction of objects from a minimum number of distorted patterns
• Efficient reconstruction of sequences
• Efficient reconstruction of sequences from their subsequences of supersequences

This page was built for publication: Reconstruction of a graph from 2–vicinities of its vertices