On the Laplacian spectral radii of bipartite graphs

Jianxi LI, Wai Chee SHIU, Wai Hong CHAN

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

The Laplacian spectral radius of a graph is the largest eigenvalue of the associated Laplacian matrix. In this paper, we provide structural and behavioral details of graphs with maximum Laplacian spectral radius among all bipartite connected graphs of given order and size. Using these results, we provide a unified approach to determine the graphs with maximum Laplacian spectral radii among all trees, and all bipartite unicyclic, bicyclic, tricyclic and quasi-tree graphs, respectively. Copyright © 2011 Elsevier Inc.
Original languageEnglish
Pages (from-to)2183-2192
JournalLinear Algebra and Its Applications
Volume435
Issue number9
DOIs
Publication statusPublished - Nov 2011

Fingerprint

Laplacian Spectral Radius
Bipartite Graph
Graph in graph theory
Laplacian Matrix
Largest Eigenvalue
Connected graph

Citation

Li, J., Shiu, W. C., & Chan, W. H. (2011). On the Laplacian spectral radii of bipartite graphs. Linear Algebra and Its Applications, 435(9), 2183-2192. doi: 10.1016/j.laa.2011.04.008

Keywords

  • Bipartite graph
  • Laplacian spectral radius