2 papers
math.CO2026
A Reduction of the Reconstruction Conjecture using Domination and Vertex Pair Parameters
J. Antony Aravind, S. Monikandan
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…
math.CO2018
Degree Associated Edge Reconstruction Parameters of Strong Double Brooms
P. Anushadevi, S. Monikandan
An edge deleted unlabeled subgraph of a graph G is an ecard. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction num…