On the First Eigenvalue of Bipartite Graphs

Simple item page
dc.creatorBhattacharya, Amitava
dc.creatorFriedland, Shmuel
dc.creatorPeled, Uri N.
dc.date2008-09-09
dc.date.accessioned2026-07-07T10:01:47Z
dc.date.available2026-07-07T10:01:47Z
dc.descriptionIn 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.
dc.description22 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/0809.1615
dc.identifierhttp://arxiv.org/abs/0809.1615
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/168745
dc.subjectCombinatorics
dc.subject05C07, 05C35, 05C50, 15A18
dc.titleOn the First Eigenvalue of Bipartite Graphs
dc.typetext

Files

Collections

arXiv