On the signless Laplacian spectral radius of graphs with cut vertices

DOI10.1016/J.LAA.2010.04.041zbMATH Open1215.05108OpenAlexW1967678987MaRDI QIDQ984858FDOQ984858

Authors: Bao-Xuan Zhu 

Publication date: 20 July 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2010.04.041

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

zbMATH Keywords

graphsspectral radiussignless Laplacian matrixcut vertices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites Work

• Graph theory
• Signless Laplacians of finite graphs
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• Eigenvalue bounds for the signless laplacian
• Title not available (Why is that?)
• On the spectral radius of graphs with cut vertices
• The Laplacian Spectrum of a Graph
• Towards a spectral theory of graphs based on the signless Laplacian. I
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
• The signless Laplacian spectral radius of graphs with given chromatic number
• On the spectral radius of graphs with cut edges

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
• Title not available (Why is that?)
• On the signless Laplacian index of cacti with a given number of pendant vertices
• On the spectral radius of graphs with cut vertices
• On the spectral radius of graphs with cut edges
• On graphs with eigenvectors in \(\{-1,0,1\}\) and the max \(k\)-cut problem
• On the signless Laplacian index of unicyclic graphs with fixed diameter
• 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)