On the reconstruction of the characteristic polynomial of a graph

DOI10.1016/S0012-365X(99)00207-1zbMath0942.05046OpenAlexW2071541852WikidataQ127526415 ScholiaQ127526415MaRDI QIDQ1970575

Dragos Cvetković

Publication date: 15 August 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00207-1

zbMATH Keywords

characteristic polynomialtreesreconstruction conjecturegraph spectra

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

Polynomial reconstruction of signed graphs ⋮ Notes on the polynomial reconstruction of signed graphs ⋮ Polynomial reconstruction of signed graphs whose least eigenvalue is close to -2 ⋮ Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs ⋮ The polynomial reconstruction problem: the first 50 years ⋮ Unnamed Item ⋮ On the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by \(-2\) ⋮ The polynomial reconstruction of unicyclic graphs is unique

This page was built for publication: On the reconstruction of the characteristic polynomial of a graph