Some notes on the spectral perturbations of the signless Laplacian of a graph
From MaRDI portal
Publication:2514966
DOI10.1007/s11766-014-3155-9zbMath1313.05257OpenAlexW2042823240MaRDI QIDQ2514966
Gaixiang Cai, Gui-Dong Yu, Yi-Zheng Fan
Publication date: 11 February 2015
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11766-014-3155-9
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Signless Laplacians of finite graphs
- Unoriented Laplacian maximizing graphs are degree maximal
- Laplacian graph eigenvectors
- Commutativity and spectra of Hermitian matrices
- Algebraic graph theory without orientation
- Which graphs are determined by their spectrum?
- Enumeration of cospectral graphs.
- Minimizing the Laplacian spectral radius of trees with given matching number
- Eigenvalue bounds for the signless laplacian
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- A characterization of the smallest eigenvalue of a graph
- Signless Laplacians and line graphs
This page was built for publication: Some notes on the spectral perturbations of the signless Laplacian of a graph