TY - JOUR
T1 - On the Laplacian spectral radii of bipartite graphs
AU - Li, Jianxi
AU - Shiu, Wai Chee
AU - Chan, Wai Hong
N1 - Funding Information:
Partially supported by FRG, Hong Kong Baptist University; the Research Fund of Zhangzhou Normal University (No. SJ1004). Corresponding author. E-mail addresses: [email protected] (J. Li), [email protected] (W.C. Shiu), [email protected] (W.H. Chan).
PY - 2011/11/1
Y1 - 2011/11/1
N2 - 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.
AB - 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.
KW - Bipartite graph
KW - Laplacian spectral radius
UR - http://www.scopus.com/inward/record.url?scp=79958834428&partnerID=8YFLogxK
U2 - 10.1016/j.laa.2011.04.008
DO - 10.1016/j.laa.2011.04.008
M3 - Journal article
AN - SCOPUS:79958834428
SN - 0024-3795
VL - 435
SP - 2183
EP - 2192
JO - Linear Algebra and Its Applications
JF - Linear Algebra and Its Applications
IS - 9
ER -