Ordering graphs with given size by their signless Laplacian spectral radii

DOI10.1007/s40840-022-01312-1zbMath1506.05133OpenAlexW4281487206MaRDI QIDQ2082377

Rong Zhang, Shu-Guang Guo

Publication date: 4 October 2022

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-022-01312-1

zbMATH Keywords

orderingupper bounddiametersizesignless Laplacian spectral radius

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

Maxima of the \(Q\)-spectral radius of \(C_3 (C_4)\)-free graphs with given size and minimum degree \(\delta \geq 2\) ⋮ Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size ⋮ Some extremal problems on \(A_\alpha \)-spectral radius of graphs with given size ⋮ Maxima of the \(A_\alpha\)-index of graphs with given size and domination number

Cites Work

• Unnamed Item
• Unnamed Item
• Ordering (signless) Laplacian spectral radii with maximum degrees of graphs
• Lower bounds for the clique and the chromatic numbers of a graph
• On the Laplacian spectral radius of trees with fixed diameter
• Signless Laplacians of finite graphs
• Bounds on the index of the signless Laplacian of a graph
• More spectral bounds on the clique and independence numbers
• On the spectral radius of (0,1)-matrices
• On the maximal index of graphs with a prescribed number of edges
• A note on Laplacian graph eigenvalues
• On the Laplacian eigenvalues of a graph
• Eigenvalues of subgraphs of the cube
• The Laplacian spectrum of a graph
• A bound on the spectral radius of graphs with \(e\) edges
• Maxima of \(L\)-index and \(Q\)-index: graphs with given size and diameter
• The spectral Turán problem about graphs with no 6-cycle
• The signless Laplacian spectral radius of graphs with a prescribed number of edges
• Three conjectures in extremal spectral graph theory
• Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
• Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter
• Eigenvalue bounds for the signless laplacian
• Towards a spectral theory of graphs based on the signless Laplacian, I
• On three conjectures involving the signless Laplacian spectral radius of graphs
• Inequalities for Graph Eigenvalues
• The Eigenvalues of a Graph and Its Chromatic Number
• An extremal problem on Q-spectral radii of graphs with given size and matching number

This page was built for publication: Ordering graphs with given size by their signless Laplacian spectral radii