On the First Eigenvalue of Bipartite Graphs
Combinatorics
2008-09-10 v1
Abstract
In this paper we study the maximum value of the largest eigenvalue for simple bipartite graphs, where the number of edges is given and the number of vertices on each side of the bipartition is given. We state a conjectured solution, which is an analog of the Brualdi- Hoffman conjecture for general graphs, and prove the conjecture in some special cases.
Keywords
Cite
@article{arxiv.0809.1615,
title = {On the First Eigenvalue of Bipartite Graphs},
author = {Amitava Bhattacharya and Shmuel Friedland and Uri N. Peled},
journal= {arXiv preprint arXiv:0809.1615},
year = {2008}
}
Comments
22 pages, 2 figures