A note on (signless) Laplacian spectral ordering with maximum degrees of graphs

DOI10.1016/j.laa.2016.12.043zbMath1357.05086OpenAlexW2571450568MaRDI QIDQ513254

Huiqiu Lin, Shuting Liu, Jin-Long Shu

Publication date: 3 March 2017

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

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

zbMATH Keywords

maximum degreesignless Laplacian spectral radiusLaplacian spectral radiusspectral ordering

Mathematics Subject Classification ID

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

Related Items (3)

Corrigendum to: ``A note on (signless) Laplacian spectral ordering with maximum degrees of graphs ⋮ Ordering graphs by their largest (least) A_α-eigenvalues ⋮ Ordering \(Q\)-indices of graphs: given size and circumference

Cites Work

• Unnamed Item
• Unnamed Item
• Ordering (signless) Laplacian spectral radii with maximum degrees of graphs
• The Laplacian spectral radius of trees and maximum vertex degree
• On the Laplacian spectral radii of bicyclic graphs
• On the Laplacian spectral radii of trees
• The signless Laplacian spread
• A note on Laplacian graph eigenvalues
• Laplacian matrices of graphs: A survey
• The Laplacian spectrum of a graph
• Maximizing the sum of the squares of the degrees of a graph
• Laplacian spectral radius of $\bm c$-cyclic graph and maximum vertex degree
• Ordering trees by their largest eigenvalues
• Ordering trees by their largest eigenvalues

This page was built for publication: A note on (signless) Laplacian spectral ordering with maximum degrees of graphs