\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Cheng Yeaw Ku and K.B. Wong}
%
%
\medskip
\noindent
%
%
{\bf Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover}
%
%
\vskip 5mm
\noindent
%
%
%
%
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.  



\bye