A reduction of the graph reconstruction conjecture

DOI10.7151/dmgt.1746zbMath1292.05190OpenAlexW2083771386WikidataQ123141380 ScholiaQ123141380MaRDI QIDQ2509541

S. Monikandan, J. Balakumar

Publication date: 28 July 2014

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1746

zbMATH Keywords

diameterreconstructiongeodetic graphinterval-regular graph

Mathematics Subject Classification ID

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

Related Items (2)

Reconstruction of distance hereditary 2-connected graphs ⋮ Unnamed Item

Cites Work

• \((0,\lambda)\)-graphs and \(n\)-cubes
• Geodetic blocks of diameter three
• The reconstruction of maximal planar graphs. I: Recognition
• The reconstruction of maximal planar graphs. II: Reconstruction
• Some work towards the proof of the reconstruction conjecture
• The reconstruction of outerplanar graphs
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible
• Graph reconstruction—a survey
• Nearly acyclic graphs are reconstructible
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A reduction of the graph reconstruction conjecture