On the First Eigenvalue of Bipartite Graphs

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
22 pages, 2 figures

Citation

Consulte el texto completo en el siguiente enlace:

Collections