Spectral conditions for the reconstructibility of a graph

DOI10.1016/0095-8956(81)90046-0MaRDI QIDQ1252246zbMATH OpenOpenAlexFDO

Authors Chris 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)

Cited in

(32)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252246)