On the largest eigenvalues of bipartite graphs which are nearly complete (Q1044557)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the largest eigenvalues of bipartite graphs which are nearly complete |
scientific article; zbMATH DE number 5650000
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the largest eigenvalues of bipartite graphs which are nearly complete |
scientific article; zbMATH DE number 5650000 |
Statements
On the largest eigenvalues of bipartite graphs which are nearly complete (English)
0 references
18 December 2009
0 references
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)].
0 references
bipartite graph
0 references
eigenvector
0 references
largest eigenvalue
0 references
