Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover
Cheng Yeaw Ku, Kok Bin Wong · The Electronic Journal of Combinatorics · 2009
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2009
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.
Open the resolved locator · 10.37236/170
Metadata licence: OpenAlex metadata (CC0)