{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:12Z","timestamp":1753893792750,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>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.  <\/jats:p>","DOI":"10.37236\/170","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T23:28:39Z","timestamp":1578698919000},"source":"Crossref","is-referenced-by-count":4,"title":["Maximum Multiplicity of a Root of the Matching Polynomial of a Tree and Minimum Path Cover"],"prefix":"10.37236","volume":"16","author":[{"given":"Cheng Yeaw","family":"Ku","sequence":"first","affiliation":[]},{"given":"K. B.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2009,7,2]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r81\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v16i1r81\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T21:50:41Z","timestamp":1579297841000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v16i1r81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,2]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2009,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/170","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2009,7,2]]},"article-number":"R81"}}