Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph
From MaRDI portal
Publication:1684932
DOI10.1007/s00373-017-1831-2zbMath1380.05122OpenAlexW2736620986MaRDI QIDQ1684932
Publication date: 12 December 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1831-2
Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Spektren endlicher Grafen
- On the Laplacian coefficients of acyclic graphs
- Signless Laplacians of finite graphs
- On the spectral characterizations of \(\infty \)-graphs
- Some results on the signless Laplacians of graphs
- A certain polynomial of a graph and graphs with an extremal number of trees
- The characteristic polynomial of the Laplacian of graphs in (\(a\), \(b\))-linear classes
- On the signless Laplacian coefficients of unicyclic graphs
- The characteristic polynomial of a graph
- No starlike trees are cospectral
This page was built for publication: Coefficients of the characteristic polynomial of the (signless, normalized) Laplacian of a graph