Name
Abstract | ||
|---|---|---|
The signless Laplacian matrix graph is the sum of its degree diagonal and adjacency matrices. In this paper, we present a sharp upper bound for the spectral radius of the adjacency matrix of a graph. Then this result and other known results are used to obtain two new sharp upper bounds for the signless Laplacian spectral radius. Moreover, the extremal graphs which attain an upper bound are characterized. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1142/S1793830911001152 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Signless Laplacian matrix, spectral radius, graph, adjacencymatrix | Adjacency matrix,Laplacian matrix,Discrete mathematics,Combinatorics,Spectral graph theory,Graph energy,Spectral radius,Upper and lower bounds,Degree matrix,Mathematics,Laplace operator | Journal |
Volume | Issue | ISSN |
3 | 2 | 1793-8309 |
Citations | PageRank | References |
1 | 0.45 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ya-Hong Chen | 1 | 1 | 0.45 |
| Rong-Ying Pan | 2 | 1 | 0.79 |
| Xiao-Dong Zhang | 3 | 38 | 4.97 |