Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/28144
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSciriha, Irene-
dc.contributor.authorFormosa, Juanita M.-
dc.date.accessioned2018-03-22T10:43:43Z-
dc.date.available2018-03-22T10:43:43Z-
dc.date.issued2001-
dc.identifier.citationSciriha, I., & Formosa, J. M. (2001). On polynomial reconstruction of disconnected graphs. Utilitas Mathematica, 64, 33-44.en_GB
dc.identifier.urihttps://www.um.edu.mt/library/oar//handle/123456789/28144-
dc.description.abstractLet H be a disconnected graph with connected components H1, H2, ..., Ht. If the characteristic polynomial of H were not reconstructible from the deck of characteristic polynomials of its one-vertex deleted subgraphs, then H would consist of exactly two connected components of the same order. We show that if H has a pendant edge in the component with the larger number of edges or if the smaller component of H is a tree, then H is polynomial reconstructible.en_GB
dc.language.isoenen_GB
dc.publisherDepartment of Computer Science. University of Manitobaen_GB
dc.rightsinfo:eu-repo/semantics/openAccessen_GB
dc.subjectMathematics -- Charts, diagrams, etc.en_GB
dc.subjectEigenvaluesen_GB
dc.subjectMathematics -- Problems, exercises, etc.en_GB
dc.titleOn polynomial reconstruction 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.titleUtilitas Mathematicaen_GB
Appears in Collections:Scholarly Works - FacSciMat

Files in This Item:
File Description SizeFormat 
On_polynomial_reconstruction_of_disconnected_graphs_2001.pdf560.47 kBAdobe PDFView/Open


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