Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/103536
| Title: | Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover | Authors: | Ku, C.Y. Wong, K.B. |
Issue Date: | 7-Feb-2009 | Citation: | Ku, 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. | Abstract: | We 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. | Source Title: | Electronic Journal of Combinatorics | URI: | http://scholarbank.nus.edu.sg/handle/10635/103536 | ISSN: | 10778926 |
| Appears in Collections: | Staff Publications |
Show full 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.