On the largest eigenvalues of bipartite graphs which are nearly complete

DOI10.1016/j.laa.2009.09.008zbMath1205.05136OpenAlexW1997916912MaRDI QIDQ1044557

In-Jae Kim, Yi-Fan Chen, Eryn Stehr, Brendon Watts, Hung-Lin Fu

Publication date: 18 December 2009

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.09.008

zbMATH Keywords

bipartite grapheigenvectorlargest eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (9)

On the spectral radius of bipartite graphs which are nearly complete ⋮ Unnamed Item ⋮ Counterexamples of the Bhattacharya-Friedland-Peled conjecture ⋮ Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case ⋮ A note on connected bipartite graphs of fixed order and size with maximal index ⋮ Maximize the \(Q\)-index of graphs with fixed order and size ⋮ An extending result on spectral radius of bipartite graphs ⋮ On bounds for the index of double nested graphs ⋮ Spectral radius of bipartite graphs

Cites Work

• Unnamed Item
• On the first eigenvalue of bipartite graphs
• On the two largest eigenvalues of trees
• On the largest eigenvalues of trees
• Matrix Analysis
• Invariant Subspaces of Matrices with Applications
• Linear algebra

This page was built for publication: On the largest eigenvalues of bipartite graphs which are nearly complete