Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/779| Title: | The polynomial reconstruction of unicyclic graphs is unique | Authors: | Simić, Slobodan K. Stanić, Zoran |
Affiliations: | Numerical Mathematics and Optimization | Keywords: | Adjacency matrix;Characteristic polynomial;Eigenvalues;Unicyclic graph | Issue Date: | 1-Jan-2007 | Journal: | Linear and Multilinear Algebra | Abstract: | We consider the problem of reconstructing the characteristic polynomial of a graph G from its polynomial deck, i.e. the collection P(G) of characteristic polynomials of its vertex-deleted subgraphs. Here we provide a positive solution for all unicyclic graphs. © 2007 Taylor & Francis. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/779 | ISSN: | 03081087 | DOI: | 10.1080/03081080500426133 |
| Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
12
checked on Mar 7, 2025
Page view(s)
17
checked on Jan 19, 2025
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.