Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/28144
Title: | On polynomial reconstruction of disconnected graphs |
Authors: | Sciriha, Irene Formosa, Juanita M. |
Keywords: | Mathematics -- Charts, diagrams, etc. Eigenvalues Mathematics -- Problems, exercises, etc. |
Issue Date: | 2001 |
Publisher: | Department of Computer Science. University of Manitoba |
Citation: | Sciriha, I., & Formosa, J. M. (2001). On polynomial reconstruction of disconnected graphs. Utilitas Mathematica, 64, 33-44. |
Abstract: | Let 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. |
URI: | https://www.um.edu.mt/library/oar//handle/123456789/28144 |
Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
On_polynomial_reconstruction_of_disconnected_graphs_2001.pdf | 560.47 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.