2-Swappability and the Edge-Reconstruction Number of Regular Graphs

MaRDI QIDQ6259608zbMATH OpenFDO

Authors Michael S. Ross

Publication date 3 March 2015

Abstract: The edge-reconstruction number of graph $G$, denoted $ern(G)$,is the size of the smallest multiset of edge-deleted, unlabeled subgraphs of $G$, from which the structure of $G$ can be uniquely determined. That there was some connection between the areas of edge reconstruction and swappability has been known since the swapping number of a graph was first introduced by Froncek, Rosenberg, and Hlavacek in 2013. This paper illustrates the depth of that connection by proving several bridging results between those areas; in particular, when the graphs in question are both regular and 2-swappable. These connections led to the discovery of four infinite families of $rgeq3$ regular graphs with $ern(G)geq3$, contradicting the formerly conjectured upper bound.

This page was built for publication: 2-Swappability and the Edge-Reconstruction Number of Regular Graphs

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