On the largest eigenvalue of a tree with perfect matchings (Q1402067)

From MaRDI portal
Revision as of 10:55, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the largest eigenvalue of a tree with perfect matchings
scientific article

    Statements

    On the largest eigenvalue of a tree with perfect matchings (English)
    0 references
    0 references
    19 August 2003
    0 references
    Let the set of trees on \(n\) vertices with a perfect matching be ordered by the largest eigenvalue (of the adjacency matrix) of trees in non-increasing order. The first seven trees in this order are determined.
    0 references
    Tree
    0 references
    Perfect matching
    0 references
    Characteristic polynomial
    0 references
    Eigenvalue
    0 references
    Upper bound
    0 references

    Identifiers