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

  • Cheng Yeaw Ku
  • K. B. Wong

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
Article Number
R81