Graphs determined by their generalized characteristic polynomials
From MaRDI portal
Publication:624543
DOI10.1016/j.laa.2010.11.024zbMath1205.05113OpenAlexW2167424312MaRDI QIDQ624543
Publication date: 9 February 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.11.024
cospectral graphsgraph spectraBartholdi zeta functiongeneralized characteristic polynomialIhara-Selberg zeta function
Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)
Related Items (12)
The number of spanning trees in a new lexicographic product of graphs ⋮ Thermodynamic approach to generalized continua ⋮ Measuring similarity between connected graphs: the role of induced subgraphs and complementarity eigenvalues ⋮ The normalized distance Laplacian ⋮ Laplacian spectral characterization of roses ⋮ Zeta-equivalent digraphs: simultaneous cospectrality ⋮ Enumeration of graphs with the same Ihara zeta function ⋮ On bi-regular graphs determined by their generalized characteristic polynomials ⋮ The number of spanning trees in the composition graphs ⋮ The characteristic polynomial of a generalized join graph ⋮ On the construction of graphs determined by their generalized characteristic polynomials ⋮ Distinguishing graphs with zeta functions and generalized spectra
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing cospectral graphs
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Starlike trees are determined by their Laplacian spectrum
- Spectral characterizations of lollipop graphs
- The multi-fan graphs are determined by their Laplacian spectra
- On the spectral characterizations of \(\infty \)-graphs
- Which wheel graphs are determined by their Laplacian spectra?
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Counting paths in graphs
- On the spectral characterization of T-shape trees
- A generalized characteristic polynomial of a graph having a semifree action
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
- A sufficient condition for a family of graphs being determined by their generalized spectra
- On discrete subgroups of the two by two projective linear group over \(p\)-adic fields
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
This page was built for publication: Graphs determined by their generalized characteristic polynomials
