On the largest eigenvalues of bipartite graphs which are nearly complete
type: Item
instance of: scholarly article
title: On the largest eigenvalues of bipartite graphs which are nearly complete
zbMATH Open document ID: 1205.05136
author: Yifan Chen
author: Hung-Lin Fu
author: In-Jae Kim
author: Eryn Stehr
author: Brendon Watts
published in: Linear Algebra and its Applications
publication date: 2009-12-18T00:00:00Z
review text: The authors study the largest eigenvalues of bipartite graphs which are really complete. They also partially settle a conjecture posed in [\textit{A. Bhattacharya, S. Friedland} and \textit{U. N. Peled}, ``On the first eigenvalue of bipartite graphs'', Electron. J. Comb. 15, No. 1, Research Paper R144, 23 p. (2008; Zbl 1178.05061)].
reviewed by: A. Vijayakumar
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 15A18
zbMATH DE Number: 5650000
zbMATH Keywords: bipartite graph
zbMATH Keywords: eigenvector
zbMATH Keywords: largest eigenvalue
MaRDI profile type: Publication
full work available at URL: j.laa.2009.09.008
OpenAlex ID: W1997916912
cites work: On the first eigenvalue of bipartite graphs
cites work: On the largest eigenvalues of trees
cites work: On the two largest eigenvalues of trees
cites work: Matrix Analysis
cites work: Invariant Subspaces of Matrices with Applications
cites work: Linear algebra
cites work: Q4869540
DOI: 10.1016/J.LAA.2009.09.008
description: scientific article; zbMATH DE number 5650000