Reconstruction of a graph from 2-vicinities of its vertices

DOI10.1016/j.dam.2006.11.016zbMath1144.05046OpenAlexW2044570479MaRDI QIDQ947081

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

Publication date: 29 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.dam.2006.11.016

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)

Reconstructing trees from digitally convex sets ⋮ Reconstruction of permutations distorted by single Kendall \(\tau\)-errors

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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