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

MaRDI QIDQ2380236zbMATH OpenFDO

Authors Cheng Yeaw Ku, K. B. Wong

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0810.4986, https://eudml.org/doc/226034, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r81.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: 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.

Review text

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.

Recommendations

• Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
• On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree
• scientific article; zbMATH DE number 2140696
• Algorithmic proof of MaxMult\((T)=p(T)\)
• Algebraic matching theory

Cited in

(11)

• On the largest matching roots of graphs with cut edges
• Gallai-Edmonds structure theorem for weighted matching polynomial
• Generalizing Tutte's theorem and maximal non-matchable graphs
• scientific article; zbMATH DE number 2140696 (Why is no real title available?)
• THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH
• Extensions of barrier sets to nonzero roots of the matching polynomial
• Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs
• Generalized \(D\)-graphs for nonzero roots of the matching polynomial
• The matching polynomial of the path-tree of a complete graph
• Eigenvalues of universal covers and the matching polynomial
• On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree

This page was built for publication: Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380236)