On the first eigenvalue of bipartite graphs (Q1010881)

From MaRDI portal
Revision as of 18:34, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references