On the largest matching roots of graphs with a given number of pendent vertices (Q1727760)

From MaRDI portal
Revision as of 06:07, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
On the largest matching roots of graphs with a given number of pendent vertices
scientific article

    Statements

    On the largest matching roots of graphs with a given number of pendent vertices (English)
    0 references
    0 references
    0 references
    0 references
    20 February 2019
    0 references
    matching polynomial
    0 references
    largest matching root
    0 references
    pendent vertex
    0 references
    extremal graph
    0 references

    Identifiers

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