Reconstruction of distance hereditary 2-connected graphs

DOI10.1016/j.disc.2018.05.003zbMath1388.05102OpenAlexW2806411236MaRDI QIDQ1637150

P. Devi Priya, S. Monikandan

Publication date: 7 June 2018

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

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

zbMATH Keywords

distanceconnectivityreconstruction

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items

Unnamed Item, Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs, Nonsplit Graphs with Split Maximal Induced Subgraphs, Reconstruction number of graphs with unique pendant vertex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-hereditary graphs
• Some work towards the proof of the reconstruction conjecture
• Centers and medians of distance-hereditary graphs
• Powers of distance-hereditary graphs
• A reduction of the graph reconstruction conjecture
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• A characterization of ptolemaic graphs
• The falsity of the reconstruction conjecture for tournaments
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Graph reconstruction—a survey