On the first eigenvalue of bipartite graphs (Q1010881)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5541049
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the first eigenvalue of bipartite graphs |
scientific article; zbMATH DE number 5541049 |
Statements
On the first eigenvalue of bipartite graphs (English)
0 references
7 April 2009
0 references
Summary: 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.
0 references
largest eigenvalue
0 references
simple bipartite graphs
0 references
analog of the Brualdi-Hoffman conjecture for general graphs
0 references
0.8586951494216919
0 references
0.8427637815475464
0 references
0.8366767168045044
0 references
0.8024975657463074
0 references
0.8017873764038086
0 references
