1. OAR@UM
  2. Faculty of Science
  3. Department of Mathematics
  4. Scholarly Works - FacSciMat
Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/112083
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAsciak, Kevin J.-
dc.contributor.authorLauri, Josef-
dc.date.accessioned2023-07-27T10:39:17Z-
dc.date.available2023-07-27T10:39:17Z-
dc.date.issued2011-
dc.identifier.citationAsciak, K., & Lauri, J. (2011). On the edge-reconstruction number of disconnected graphs. Bulletin of the ICA, 63, 87-100.en_GB
dc.identifier.urihttps://www.um.edu.mt/library/oar/handle/123456789/112083-
dc.description.abstractThe edge-reconstruction number of a graph G is the minimum number of edge-deleted subgraphs which are required to determine the isomorphism type of G. Molina has shown that a disconnected graph whose components are not all isomorphic has edge-reconstruction number at most three. He also showed that under certain conditions, including the property that at least one component has a cycle, the edge-reconstruction number is 2. In this paper we give an alter-native proof of Molina’s main result, characterise those disconnected graphs which have the largest possible edge-reconstruction number, and we also investigate what properties can force a forest to have edge-reconstruction number 2.en_GB
dc.language.isoenen_GB
dc.publisherInstitute of Combinatorics and its Applicationsen_GB
dc.rightsinfo:eu-repo/semantics/restrictedAccessen_GB
dc.subjectGraph theoryen_GB
dc.subjectGraphic methodsen_GB
dc.subjectMathematics -- Charts, diagrams, etc.en_GB
dc.titleOn the edge-reconstruction number of disconnected graphsen_GB
dc.typearticleen_GB
dc.rights.holderThe copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder.en_GB
dc.description.reviewedpeer-revieweden_GB
dc.publication.titleBulletin of the ICAen_GB
Appears in Collections:Scholarly Works - FacSciMat

Files in This Item:
File Description SizeFormat 
On_the_edge_reconstruction_number_of_disconnected_graphs_2011.pdf
  Restricted Access		145.54 kBAdobe PDFView/Open Request a copy
Show simple item record Statistics


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.