Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/111599
Title: | On the edge-reconstruction number of a tree |
Authors: | Asciak, Kevin J. Lauri, Josef Myrvold, Wendy Pannone, Virgilio |
Keywords: | Graph theory Mathematics Graphic methods Charts, diagrams, etc. |
Issue Date: | 2014 |
Publisher: | Centre for Discrete Mathematics & Computing |
Citation: | Asciak, K., Lauri, J., Myrvold, W., & Pannone, V. (2014). On the edge-reconstruction number of a tree. Australasian Journal of Combinatorics, 60(2), 169-190. |
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 isomorphism. 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. |
URI: | https://www.um.edu.mt/library/oar/handle/123456789/111599 |
Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
On_the_edge_reconstruction_number_of_a_tree_2014.pdf | 240.06 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.