Contents

Ars Combinatoria

  • Research article

The Laplacian Spectral Radius of Graphs with Given Connectivity

Lihua Feng1, Aleksandar Ilic2
1School of Mathematics, Shandong Institute of Business and Technology 191 Binhaizhong Road, Yantai, Shandong, P.R. China, 264005. ’
2Paculty of Sciences and Mathematics, University of Nis Vigegradska 33, 18000 Nis, Serbia
  • Published: 30/04/2012

Abstract

Motivated by the results from [J. Li, W. Shiu, W. Chan, The Laplacian spectral radius of some graphs, Linear Algebra Appl. \(431 (2009) 99-103]\), we determine the extremal graphs with the second largest Laplacian spectral radius among all bipartite graphs with vertex connectivity \(k\).

Citation
Lihua Feng, Aleksandar Ilic. The Laplacian Spectral Radius of Graphs with Given Connectivity[J], Ars Combinatoria, Volume 104. 489-495. .