Reconstruction of 2-connected parity graphs

MaRDI QIDQ5000297zbMATH OpenFDO

Authors P. Devi Priya, S. Monikandan

Publication date 12 July 2021

Full work available at URL http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p167.pdf

zbMATH Keywords

parity graphsreconstructible graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Reconstruction of distance hereditary 2-connected graphs
• Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
• Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
• scientific article; zbMATH DE number 5914899
• All graphs are set reconstructible if all 2-connected graphs are set reconstructible.

Cites work

• scientific article; zbMATH DE number 3889564 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 4097430 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 1051281 (Why is no real title available?)
• scientific article; zbMATH DE number 1146222 (Why is no real title available?)
• scientific article; zbMATH DE number 1952951 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A reduction of the graph reconstruction conjecture
• Graph reconstruction conjecture: reductions using complement, connectivity and distance
• Graph reconstruction—a survey
• Reconstruction of bipartite graphs and triangle-free graphs with connectivity two
• Reconstruction of distance hereditary 2-connected graphs
• Some work towards the proof of the reconstruction conjecture
• The falsity of the reconstruction conjecture for tournaments
• The reconstruction conjecture is true if all 2-connected graphs are reconstructible

Cited in

(4)

• Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
• Reconstruction of distance hereditary 2-connected graphs
• Reconstruction and edge reconstruction of triangle-free graphs
• Reconstruction of bipartite graphs and triangle-free graphs with connectivity two

This page was built for publication: Reconstruction of 2-connected parity graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000297)