The characteristic polynomials of modified graphs

DOI10.1016/0166-218X(96)85159-6zbMath0851.05076OpenAlexW2091951870MaRDI QIDQ1917341

Peter Rowlinson

Publication date: 7 July 1996

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

Full work available at URL: https://doi.org/10.1016/0166-218x(96)85159-6

zbMATH Keywords

characteristic polynomial

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (6)

Constructions of isospectral circulant graphs ⋮ A formalism for evaluating analytically the cross-correlation structure of a firing-rate network model ⋮ Construction of cospectral graphs ⋮ Which graphs are determined by their spectrum? ⋮ On perturbations of almost distance-regular graphs ⋮ Spectra of Extended Double Cover Graphs

Cites Work

• Constructing cospectral graphs
• On the power of a perturbation for testing non-isomorphism of graphs
• Derived eigenvalues of symmetric matrices, with applications to distance geometry
• Spectral conditions for the reconstructibility of a graph
• A study of eigenspaces of graphs
• A deletion-contraction algorithm for the characteristic polynomial of a multigraph
• On the index of tricyclic Hamiltonian graphs
• Walk Generating Functions, Christoffel-Darboux Identities and the Adjacency Matrix of a Graph
• Developments in the theory of graph spectra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The characteristic polynomials of modified graphs