Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover
classification
🧮 math.CO
keywords
covermatchingmaximumminimummultiplicitypolynomialroottree
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.