Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949580 | Discrete Applied Mathematics | 2017 | 9 Pages |
Abstract
Let Gn,m be the set of all connected bipartite graphs of order n and size m. In this paper, the problem on maximum Laplacian spectral radius of graphs in Gn,m is considered. Among Gn,m with n⩽m⩽2nâ5, the largest Laplacian spectral radius of graphs is determined. As well the upper bound on Laplacian spectral radius of graphs among Gn,l(nâl) with 2⩽l⩽ân2â is determined. All the corresponding extremal graphs are characterized, respectively.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Huihui Zhang, Shuchao Li,