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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call