Spectral conditions for the reconstructibility of a graph

DOI10.1016/0095-8956(81)90046-0zbMath0394.05035OpenAlexW2001194443MaRDI QIDQ1252246

Chris D. Godsil, Brendan D. McKay

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90046-0

zbMATH Keywords

EigenvaluesEigenvectorsReconstrucibilitySpectral Conditions

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 (28)

Equiangular lines in Euclidean spaces: Dimensions 17 and 18 ⋮ Unlocking the walk matrix of a graph ⋮ Some results on the spectral reconstruction problem ⋮ On strongly asymmetric and controllable primitive graphs ⋮ Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph ⋮ The characteristic polynomials of modified graphs ⋮ Controllability of NEPSes of graphs ⋮ Forbidden subgraphs for graphs of bounded spectral radius, with applications to equiangular lines ⋮ Further results on almost controllable graphs ⋮ Almost controllable graphs and beyond ⋮ Feasibility conditions for the existence of walk-regular graphs ⋮ A walk-regular graph, cospectral to its complement, need not be strongly regular ⋮ An eigenvector condition for reconstructibility ⋮ Note on graphs with irreducible characteristic polynomials ⋮ Edge reconstruction of the Ihara zeta function ⋮ On perturbations of almost distance-regular graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Graphs with \(n - 1\) main eigenvalues ⋮ A uniqueness theorem on matrices and reconstruction ⋮ On regular signed graphs with three eigenvalues ⋮ The largest eigenvalue of a graph: A survey ⋮ On equiangular lines in $17$ dimensions and the characteristic polynomial of a Seidel matrix ⋮ Equiangular lines in low dimensional Euclidean spaces ⋮ Distance-regularised graphs are distance-regular or distance-biregular ⋮ Developments in the theory of graph spectra ⋮ Graph isomorphism and equality of simplices ⋮ On a conjecture of He concerning the spectral reconstruction of matrices ⋮ Eigenvectors from eigenvalues: A survey of a basic identity in linear algebra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spectral conditions for the reconstructibility of a graph