The maximum spectral radius of irregular bipartite graphs
From MaRDI portal
(Redirected from Publication:2081918)
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 is . 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 , 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.
Recommendations
- The spectral radius and the maximum degree of irregular graphs
- A note on spectral radius and maximum degree of irregular graphs
- The spectral radius of irregular graphs
- A new result on spectral radius and maximum degree of irregular graphs
- On the spectral radius of bipartite graphs
- On the spectral radius of bipartite graphs
- On the maximum spectral radius of multipartite graphs
- Spectral radius of bipartite graphs
- Characterization of bipartite graph with maximum spectral radius
- The Laplacian spectral radius of some bipartite graphs
Cites work
- A note on the largest eigenvalue of non-regular graphs
- Analytic Results for the Eigenvalues of Certain Tridiagonal Matrices
- Eigenspaces of graphs
- Eigenvectors and eigenvalues of non-regular graphs
- Extreme eigenvalues of nonregular graphs
- On \(\lambda_{1}\)-extremal non-regular graphs
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- On the first eigenvalue of bipartite graphs
- On the largest eigenvalue of non-regular graphs
- Regular graphs with minimum spectral gap
- Spectral radius of graphs
- The (signless Laplacian) spectral radii of connected graphs with prescribed degree sequences
- The largest eigenvalue of nonregular graphs
- The spectral radius and the maximum degree of irregular graphs
- The spectral radius of irregular graphs
- The spectral radius of trees on \(k\) pendant vertices
Cited in
(4)
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)