On the signless Laplacian spectral radius of graphs with cut vertices
From MaRDI portal
(Redirected from Publication:984858)
Recommendations
- Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
- The signless Laplacian spectral radius of graphs with given number of pendant vertices
- On the spectral radius of graphs with cut vertices
- On the spectral radius of graphs with cut edges
- Some results on Laplacian spectral radius of graphs with cut vertices
Cites work
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
- Eigenvalue bounds for the signless laplacian
- Graph theory
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the spectral radius of graphs with cut edges
- On the spectral radius of graphs with cut vertices
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Signless Laplacians of finite graphs
- The Laplacian Spectrum of a Graph
- The signless Laplacian spectral radius of graphs with given chromatic number
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
Cited in
(17)- On the minimal \(\mathcal{D}_\alpha -\) spectral radius of graphs subject to fixed connectivity
- A note on the \(A_{\alpha}\)-spectral radius of graphs
- Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
- The signless Laplacian spectral radius of graphs with no intersecting triangles
- Some results on Laplacian spectral radius of graphs with cut vertices
- On the signless Laplacian index of cacti with a given number of pendant vertices
- scientific article; zbMATH DE number 5844325 (Why is no real title available?)
- On the spectral radius of graphs with cut vertices
- On the spectral radius of graphs with cut edges
- On the signless Laplacian index of unicyclic graphs with fixed diameter
- On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem
- Bounds on the eigenvalues of graphs with cut vertices or edges
- The least eigenvalue of the signless Laplacian of the complements of trees
- The signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edges
- The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
- The second least eigenvalue of the signless Laplacian of the complements of trees
- Bound on the least eigenvalue of a graph with cut vertices
This page was built for publication: On the signless Laplacian spectral radius of graphs with cut vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984858)