Geodesic
Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/170
Classification : 05C31, 05C70, 05C35, 05C05 
@article{10_37236_170,
     author = {Cheng Yeaw Ku and K. B. Wong},
     title = {Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/170},
     zbl = {1230.05168},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/170/}
}
TY  - JOUR
AU  - Cheng Yeaw Ku
AU  - K. B. Wong
TI  - Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/170/
DO  - 10.37236/170
ID  - 10_37236_170
ER  - 
%0 Journal Article
%A Cheng Yeaw Ku
%A K. B. Wong
%T Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/170/
%R 10.37236/170
%F 10_37236_170
Cheng Yeaw Ku; K. B. Wong. Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/170

Cité par Sources :