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

preprint2008arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.