A Reduction of the Reconstruction Conjecture using Domination and Vertex Pair Parameters
J. Antony Aravind, S. Monikandan

TL;DR
This paper advances the graph reconstruction conjecture by proving reconstructibility for specific graph classes using new parameters and reductions, focusing on graphs with domination number 2 and diameter conditions.
Contribution
It introduces new parameters for graph reconstruction, establishes a reduction of the RC to certain 2-connected graphs, and proves reconstructibility for graphs with specific domination and diameter properties.
Findings
Graphs with domination number 2 are recognizable from their decks.
Reconstruction of certain 2-connected graphs is equivalent to the RC.
New parameters are reconstructible for large connected graphs with domination number ≥ 3.
Abstract
A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-vertex-deleted subgraphs, known as the deck of G. The Reconstruction Conjecture (RC) posits that every finite simple graph with at least three vertices is reconstructible. In this paper, we prove that the class of graphs with domination number is recognizable from the deck . We also establish a new reduction of the RC: it holds if and only if all -connected graphs with or are reconstructible. To aid reconstruction, we introduce two new parameters: , which counts the number of non-adjacent vertex pairs in with common neighbours, neighbours exclusive to the first vertex, and exclusive to the second; and , defined analogously for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Digital Image Processing Techniques
