Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover.
The Electronic Journal of Combinatorics [electronic only] (2009)
- Volume: 16, Issue: 1, page Research Paper R81, 12 p.-Research Paper R81, 12 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topKu, Cheng Yeaw, and Wong, K.B.. "Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper R81, 12 p.-Research Paper R81, 12 p.. <http://eudml.org/doc/226034>.
@article{Ku2009,
author = {Ku, Cheng Yeaw, Wong, K.B.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research Paper R81, 12 p.-Research Paper R81, 12 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover.},
url = {http://eudml.org/doc/226034},
volume = {16},
year = {2009},
}
TY - JOUR
AU - Ku, Cheng Yeaw
AU - Wong, K.B.
TI - Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper R81, 12 p.
EP - Research Paper R81, 12 p.
LA - eng
UR - http://eudml.org/doc/226034
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.