Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover

  • Cheng Yeaw Ku
  • K. B. Wong
DOI: https://doi.org/10.37236/170

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.

Published
2009-07-02
How to Cite
Ku, C. Y., & Wong, K. B. (2009). Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover. The Electronic Journal of Combinatorics, 16(1), R81. https://doi.org/10.37236/170
Issue
Volume 16, Issue 1 (2009)
Article Number
R81