Upper bound for the number of spanning forests of regular graphs (Q2700981)

From MaRDI portal
Revision as of 12:48, 7 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Upper bound for the number of spanning forests of regular graphs
scientific article

    Statements

    Upper bound for the number of spanning forests of regular graphs (English)
    0 references
    0 references
    0 references
    27 April 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Laplacian matrices
    0 references
    matching polynomial
    0 references