The polynomial reconstruction of unicyclic graphs is unique

DOI10.1080/03081080500426133zbMath1109.05076OpenAlexW2025116035MaRDI QIDQ3422757

Zoran Stanić, Slobodan K. Simic

Publication date: 14 February 2007

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081080500426133

zbMATH Keywords

eigenvaluescharacteristic polynomialadjacency matrix

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (7)

Polynomial reconstruction of signed graphs ⋮ Notes on the polynomial reconstruction of signed graphs ⋮ The polynomial reconstruction problem: the first 50 years ⋮ Graphs with a common eigenvalue deck ⋮ Unnamed Item ⋮ On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\) ⋮ On the characteristic polynomial of the power of a path.

Cites Work

• Polynomial reconstruction and terminal vertices
• On the reconstruction of the characteristic polynomial of a graph

This page was built for publication: The polynomial reconstruction of unicyclic graphs is unique