Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover (Q2380236)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
scientific article

    Statements

    Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover (English)
    0 references
    0 references
    0 references
    26 March 2010
    0 references
    Summary: We give a necessary and sufficient condition for the maximum multiplicity of a root of the matching polynomial of a tree to be equal to the minimum number of vertex disjoint paths needed to cover it.
    0 references

    Identifiers

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