Paper Info
Title
The signless Laplacian spectral radius of graphs with given degree sequences
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.
Year
DOI
Venue
2009
10.1016/j.dam.2009.02.022
Discrete Applied Mathematics
Keywords
Field
DocType
unicyclic graph,degree sequence,maximum degree,signless laplacian spectral radius,matching number,independence number,extremal unicyclic graph,largest signless,specified number,spectral radius,majorization,unicyclic graphic degree sequence,connected graph
Graphics,Discrete mathematics,Graph,Combinatorics,Spectral radius,Spectral set,Majorization,Degree (graph theory),Connectivity,Mathematics,Laplace operator
Journal
Volume
Issue
ISSN
157
13
Discrete Applied Mathematics
Citations 
PageRank 
References 
9
0.98
4
Authors
1
Name
Order
Citations
PageRank
Xiao-Dong Zhang19719.87