Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph

DOI10.1017/S0963548300000043MaRDI QIDQ4291182zbMATH OpenOpenAlexFDO

Authors Chris Godsil

Publication date 10 August 1994

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548300000043

zbMATH Keywords

adjacency matrixcharacteristic polynomialChristoffel-Darboux identitygenerating functionsreconstructibility

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)

Recommendations

• Christoffel-Darboux type identities for the independence polynomial
• On the reconstruction of the characteristic polynomial of a graph
• scientific article; zbMATH DE number 125495

Cites work

• An eigenvector condition for reconstructibility
• Spectral conditions for the reconstructibility of a graph
• The electronic structure of conjugated systems I. General theory

Cited in

(4)

• Walks on directed graphs and matrix polynomials
• The characteristic polynomials of modified graphs
• Degree sum adjacency polynomial of standard graphs and graph operations
• On perturbations of almost distance-regular graphs

This page was built for publication: Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph

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