Bounds on the independence number and signless Laplacian index of graphs
From MaRDI portal
(Redirected from Bounds on the independence number and signless Laplacian index of graphs)
Recommendations
- Bounds and conjectures for the signless Laplacian index of graphs
- Some results on the bounds of signless Laplacian eigenvalues
- Bounds on the index of the signless Laplacian of a graph
- Eigenvalue bounds for the signless laplacian
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
Cites work
- A conjecture on the diameter and signless Laplacian index of graphs
- Bounds and conjectures for the signless Laplacian index of graphs
- Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
- Edge-connectivity and (signless) Laplacian eigenvalue of graphs
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- On conjectures involving second largest signless Laplacian eigenvalue of graphs
- On the signless Laplacian index and radius of graphs
- On the signless Laplacian index of unicyclic graphs with fixed diameter
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Signless Laplacians of finite graphs
Cited in
(5)- Graphs whose second largest signless Laplacian eigenvalue does not exceed \(2+\sqrt{2}\)
- Laplacian spectral bounds for clique and independence numbers of graphs
- Bounds on the signed 2-independence number in graphs
- Extremal (balanced) blow-ups of trees with respect to the signless Laplacian index
- Bounds and conjectures for the signless Laplacian index of graphs
This page was built for publication: Bounds on the independence number and signless Laplacian index of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688866)