On the First Eigenvalue of Bipartite Graphs
classification
🧮 math.CO
keywords
graphsbipartiteconjectureeigenvaluegivennumberanalogbipartition
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.