The signless Laplacian spectral radius of graphs with given degree sequences

Authors:
Xiao-Dong Zhang
Affiliations:
Department of Mathematics, Shanghai Jiao Tong University, 800 Dongchuan Road, Shanghai, 200240, PR China
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 4
Cited 2

The Laplacian spectrum of a graph

SIAM Journal on Matrix Analysis and Applications
A characterization of the smallest eigenvalue of a graph

Journal of Graph Theory
Graph Theory With Applications

Graph Theory With Applications
Bounds on the index of the signless Laplacian of a graph

Discrete Applied Mathematics

New method and new results on the order of spectral radius

Computers & Mathematics with Applications
Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, we investigate the properties of the largest signless Laplacian spectral radius in the set of all simple connected graphs with a given degree sequence. These results are used to characterize the unicyclic graphs that have the largest signless Laplacian spectral radius for a given unicyclic graphic degree sequence. Moreover, all extremal unicyclic graphs having the largest signless Laplacian spectral radius are obtained in the sets of all unicyclic graphs of order n with a specified number of leaves or maximum degree or independence number or matching number.