Improved Upper Bounds for the Laplacian Spectral Radius of a Graph

  • Tianfei Wang
  • Jin Yang
  • Bin Li
DOI: https://doi.org/10.37236/522

Abstract

In this paper, we present three improved upper bounds for the Laplacian spectral radius of graphs. Moreover, we determine all extremal graphs which achieve these upper bounds. Finally, some examples illustrate that the results are best in all known upper bounds in some sense.

Published
2011-02-14
How to Cite
Wang, T., Yang, J., & Li, B. (2011). Improved Upper Bounds for the Laplacian Spectral Radius of a Graph. The Electronic Journal of Combinatorics, 18(1), P35. https://doi.org/10.37236/522
Issue
Volume 18, Issue 1 (2011)
Article Number
P35