| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649940 | Discrete Mathematics | 2008 | 8 Pages |
Abstract
We give some upper bounds for the spectral radius of bipartite graph and graph, which improve the result in Hong’s Paper [Y. Hong, J.-L. Shu, K. Fang, A sharp upper bound of the spectral radius of graphs, J. Combin. Theory Ser. B 81 (2001) 177–183].
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Bolian Liu,