On the edge-reconstruction number of a tree

zbMATH Open1305.05147arXiv1312.1234MaRDI QIDQ2938251

Author name not available (Why is that?)

Publication date: 14 January 2015

Abstract: The edge-reconstruction number ern$(G)$ of a graph $G$ is equal to the minimum number of edge-deleted subgraphs $G-e$ of $G$ which are sufficient to determine $G$ up to isomorphsim. Building upon the work of Molina and using results from computer searches by Rivshin and more recent ones which we carried out, we show that, apart from three known exceptions, all bicentroidal trees have edge-reconstruction number equal to 2. We also exhibit the known trees having edge-reconstruction number equal to 3 and we conjecture that the three infinite families of unicentroidal trees which we have found to have edge-reconstruction number equal to 3 are the only ones.

Full work available at URL: https://arxiv.org/abs/1312.1234

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: On the edge-reconstruction number of a tree

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