Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs
From MaRDI portal
Publication:2828833
DOI10.1007/s10587-016-0308-4zbMath1413.05223OpenAlexW2530090795MaRDI QIDQ2828833
Publication date: 26 October 2016
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10338.dmlcz/145887
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)
Cites Work
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- The smallest Laplacian spectral radius of graphs with a given clique number
- Spectral radii of graphs with given chromatic number
- Bounds and conjectures for the signless Laplacian index of graphs
- On the spectral radius of (0,1)-matrices
- Laplacian matrices of graphs: A survey
- The smallest signless Laplacian spectral radius of graphs with a given clique number
- Bounds on graph eigenvalues. II
- The (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices
- The maximum clique and the signless Laplacian eigenvalues
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Quotient of spectral radius, (signless) Laplacian spectral radius and clique number of graphs