The maximum spectral radius of irregular bipartite graphs

From MaRDI portal
Publication:2081918

DOI10.1016/J.AAM.2022.102433zbMATH Open1498.05177arXiv2205.07710OpenAlexW4296311375WikidataQ114214484 ScholiaQ114214484MaRDI QIDQ2081918FDOQ2081918

Rui-fang Liu, Jinlong Shu, Jiaxin Guo, Jie Xue

Publication date: 30 September 2022

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: A bipartite graph is subcubic if it is an irregular bipartite graph with maximum degree three. In this paper, we prove that the asymptotic value of maximum spectral radius over subcubic bipartite graphs of order n is 3βˆ’varTheta(fracpi2n2). Our key approach is taking full advantage of the eigenvalues of certain tridiagonal matrices, due to Willms [SIAM J. Matrix Anal. Appl. 30 (2008) 639--656]. Moreover, for large maximum degree, i.e., the maximum degree is at least lfloorn/2floor, we characterize irregular bipartite graphs with maximum spectral radius. For general maximum degree, we present an upper bound on the spectral radius of irregular bipartite graphs in terms of the order and maximum degree.


Full work available at URL: https://arxiv.org/abs/2205.07710





Cites Work


Cited In (3)


Recommendations





This page was built for publication: The maximum spectral radius of irregular bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2081918)