The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
From MaRDI portal
Publication:1967108
zbMath0938.05044MaRDI QIDQ1967108
Publication date: 12 March 2000
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/120317
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)
The idiosyncratic polynomial of digraphs ⋮ On conjugate adjacency matrices of a graph ⋮ 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. ⋮ Reconstructing subgraph-counting graph polynomials of increasing families of graphs
This page was built for publication: The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
