Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible

DOI10.1007/s13226-019-0339-2zbMath1429.05055OpenAlexW2944914530MaRDI QIDQ2283214

S. Monikandan, P. Devi Priya

Publication date: 30 December 2019

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-019-0339-2

zbMATH Keywords

distanceconnectivityreconstructiondistance hereditary graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some work towards the proof of the reconstruction conjecture
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey

This page was built for publication: Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible