On graphs whose signless Laplacian index does not exceed 4.5

From MaRDI portal
Revision as of 21:46, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1019644

DOI10.1016/j.laa.2009.02.017zbMath1171.05035OpenAlexW2030537268MaRDI QIDQ1019644

J. Martínez

Publication date: 4 June 2009

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

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




Related Items (30)

On Quipus whose signless Laplacian index does not exceed 4.5The spectral characterization of wind-wheel graphsExtremal Halin graphs with respect to the signless Laplacian spectraMixed graphs with smallest eigenvalue greater than \(- \frac{ \sqrt{ 5} + 1}{ 2} \)Signless Laplacian spectral characterization of line graphs ofT-shape treesPermanental bounds for the signless Laplacian matrix of a unicyclic graph with diameter \(d\)Signless Laplacian spectral characterization of 4-rose graphsExtremal (balanced) blow-ups of trees with respect to the signless Laplacian indexOn graphs with exactly three \(Q\)-eigenvalues at least twoOn graphs whose Laplacian index does not exceed 4.5On the signless Laplacian index of cacti with a given number of pendant verticesThe \(Q\)-minimizer graph with given independence numberThe least eigenvalue of the signless Laplacian of the complements of treesLimit points for the spectral radii of signed graphsGraphs whose signless Laplacian spectral radius does not exceed the Hoffman limit valueUnnamed ItemStarlike trees whose maximum degree exceed 4 are determined by their Q-spectraThe signless Laplacian or adjacency spectral radius of bicyclic graphs with given number of cut edgesTowards a spectral theory of graphs based on the signless Laplacian. II.Spectral characterizations of graphs with small spectral radiusOn the spectral characterizations of \(\infty \)-graphsOn the two largest \(Q\)-eigenvalues of graphsThe minimum signless Laplacian spectral radius of graphs with given independence numberSome results on the signless Laplacians of graphsMaximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivityGraphs whose \(A_\alpha \) -spectral radius does not exceed 2Spectral characterizations of the corona of a cycle and two isolated verticesOn the Laplacian spectral radius of weighted trees with fixed diameter and weight setMaximizing the signless Laplacian spectral radius of graphs with given diameter or cut verticesThe second least eigenvalue of the signless Laplacian of the complements of trees



Cites Work




This page was built for publication: On graphs whose signless Laplacian index does not exceed 4.5