1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/103536
DC FieldValue
dc.titleMaximum multiplicity of a root of the matching polynomial of a tree and minimum path cover
dc.contributor.authorKu, C.Y.
dc.contributor.authorWong, K.B.
dc.date.accessioned2014-10-28T02:38:25Z
dc.date.available2014-10-28T02:38:25Z
dc.date.issued2009-02-07
dc.identifier.citationKu, C.Y.,Wong, K.B. (2009-02-07). Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover. Electronic Journal of Combinatorics 16 (1) : -. ScholarBank@NUS Repository.
dc.identifier.issn10778926
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/103536
dc.description.abstractWe give a necessary and suffcient 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.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.sourcetitleElectronic Journal of Combinatorics
dc.description.volume16
dc.description.issue1
dc.description.page-
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.