On the first eigenvalue of bipartite graphs (Q1010881): Difference between revisions
From MaRDI portal
Created a new Item |
Import IPFS CIDs |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 0809.1615 / rank | |||
Normal rank | |||
| Property / IPFS content identifier | |||
| Property / IPFS content identifier: bafkreibgpqc5aq6nefsdivzbbxxev3prn54k2dne76yu72j6yy2zcba5gq / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:13, 22 February 2025
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the first eigenvalue of bipartite graphs |
scientific article |
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
