Bounds of signless Laplacian spectrum of graphs based on the k-domination number
From MaRDI portal
Publication:2442219
Recommendations
Cites work
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Bounds of Laplacian spectrum of graphs based on the domination number
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- Signless Laplacians of finite graphs
- The k-domination number and bounds for the Laplacian eigenvalues of graphs
- The Gewirtz graph: An exercise in the theory of graph spectra
- The Laplacian Spectrum of a Graph II
- Unoriented Laplacian maximizing graphs are degree maximal
Cited in
(7)- Bounds on the independence number and signless Laplacian index of graphs
- Sharp bounds on the signless Laplacian spread of graphs
- Domination and spectral graph theory
- On the signless Laplacian index and radius of graphs
- Bounds of Laplacian spectrum of graphs based on the domination number
- Some results on the A α -eigenvalues of a graph
- Some results on the k-alliance and domination of graphs
This page was built for publication: Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442219)