{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:05:41Z","timestamp":1649127941967},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p>Let [Formula: see text] denote the set of trees on [Formula: see text] labeled vertices. In this paper, we consider the statistic on [Formula: see text] which records the number of vertices of odd degree and count trees having a prescribed number of such vertices. In doing so, we make use of a well-known bijection between members of [Formula: see text] and the set of [Formula: see text]-ary words of length [Formula: see text]. In fact, we are able to study a generalization mod [Formula: see text] of the aforementioned statistic for all [Formula: see text]. In the cases when [Formula: see text] and [Formula: see text], further enumerative results for both words and trees may be given.<\/jats:p>","DOI":"10.1142\/s1793830916500312","type":"journal-article","created":{"date-parts":[[2016,3,2]],"date-time":"2016-03-02T11:44:07Z","timestamp":1456919047000},"page":"1650031","source":"Crossref","is-referenced-by-count":0,"title":["A statistic related to trees and words on a finite alphabet"],"prefix":"10.1142","volume":"08","author":[{"given":"Toufik","family":"Mansour","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Haifa, 3498838 Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Shattuck","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Tennessee, Knoxville, TN 37996, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,5,26]]},"reference":[{"key":"S1793830916500312BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-22343-7"},{"issue":"2","key":"S1793830916500312BIB002","doi-asserted-by":"crossref","DOI":"10.37236\/1675","volume":"9","author":"Burstein A.","year":"2002","journal-title":"Electron. J. Combin."},{"key":"S1793830916500312BIB003","first-page":"1","volume":"6","author":"Burstein A.","year":"2003","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"S1793830916500312BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.03.009"},{"key":"S1793830916500312BIB006","first-page":"376","volume":"23","author":"Cayley A.","year":"1889","journal-title":"Q. J. Math."},{"key":"S1793830916500312BIB007","doi-asserted-by":"publisher","DOI":"10.1080\/09720529.2008.10698201"},{"key":"S1793830916500312BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2009.03.020"},{"key":"S1793830916500312BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90004-X"},{"key":"S1793830916500312BIB010","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"Graham R. L.","year":"1994"},{"key":"S1793830916500312BIB011","doi-asserted-by":"publisher","DOI":"10.1201\/9781420072686"},{"key":"S1793830916500312BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-012-0131-z"},{"key":"S1793830916500312BIB013","series-title":"Functional Algorithms","volume-title":"The Art of Computer Programming","volume":"1","author":"Knuth D. E.","year":"1968"},{"key":"S1793830916500312BIB014","first-page":"742","volume":"27","author":"Pr\u00fcfer H.","year":"1918","journal-title":"Arch. Math. Phys."},{"key":"S1793830916500312BIB015","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700007527"},{"key":"S1793830916500312BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2008.06.004"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830916500312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T12:21:24Z","timestamp":1600258884000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830916500312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,26]]},"references-count":15,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2016,5,26]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1142\/S1793830916500312"],"URL":"https:\/\/doi.org\/10.1142\/s1793830916500312","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,26]]}}}