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

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

2008-10-28

arxiv.org/abs/0810.4986v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-485251