Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420413 | Discrete Applied Mathematics | 2009 | 10 Pages |
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 nn with a specified number of leaves or maximum degree or independence number or matching number.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Xiao-Dong Zhang,