Bipartite graphs with bounded vertex degree and largest eigenvalue of the form r
From MaRDI portal
Publication:2323489
Recommendations
- Upper bounds for the largest eigenvalues of a bipartite graph
- Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\)
- On the first eigenvalue of bipartite graphs
- On the largest eigenvalues of bipartite graphs which are nearly complete
- The second largest eigenvalues of regular bipartite graphs
Cites work
Cited in
(6)- On the first eigenvalue of bipartite graphs
- On the largest eigenvalues of bipartite graphs which are nearly complete
- Median eigenvalues of bipartite graphs
- A necessary and sufficient eigenvector condition for a connected graph to be bipartite
- The bipartite graphs with the second maximum value of the sum of squares of degrees for fewer edges
- Upper bounds for the largest eigenvalues of a bipartite graph
This page was built for publication: Bipartite graphs with bounded vertex degree and largest eigenvalue of the form \(\sqrt{r} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2323489)