{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T16:25:05Z","timestamp":1776270305031,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,12,7]],"date-time":"2013-12-07T00:00:00Z","timestamp":1386374400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s00373-013-1383-z","type":"journal-article","created":{"date-parts":[[2013,12,6]],"date-time":"2013-12-06T15:09:46Z","timestamp":1386342586000},"page":"309-318","source":"Crossref","is-referenced-by-count":24,"title":["The Minimal Number of Subtrees with a Given Degree Sequence"],"prefix":"10.1007","volume":"31","author":[{"given":"Xiu-Mei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao-Dong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,12,7]]},"reference":[{"key":"1383_CR1","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.orl.2009.02.002","volume":"37","author":"A. Agra","year":"2009","unstructured":"Agra A., Gouveia L., Requejo C.: Extended formulations for the cardinality constrained subtree of a tree problem. Oper. Res. Lett. 37, 192\u2013196 (2009)","journal-title":"Oper. Res. Lett."},{"key":"1383_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph theory with applications. Macmillan Press, New York (1976)"},{"key":"1383_CR3","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.disopt.2011.02.002","volume":"8","author":"E. \u00c7ela","year":"2011","unstructured":"\u00c7ela E., Schmuck N.S., Wimer S., Woeginger G.J.: The Wiener maximum quadratic assignment problem. Discrete Optim. 8, 411\u2013416 (2011)","journal-title":"Discrete Optim."},{"key":"1383_CR4","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1016\/j.disc.2006.01.022","volume":"306","author":"D. Eisenstat","year":"2006","unstructured":"Eisenstat D., Gordon G.: Non-isomorphic caterpillars with identical subtree data. Discrete Math. 306, 827\u2013830 (2006)","journal-title":"Discrete Math."},{"key":"1383_CR5","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/j.aam.2006.08.005","volume":"38","author":"C. Heuberger","year":"2007","unstructured":"Heuberger C., Prodinger H.: On \u03b1-greedy expansions of numbers. Adv. Appl Math. 38, 505\u2013525 (2007)","journal-title":"Adv. Appl Math."},{"key":"1383_CR6","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1137\/070687736","volume":"22","author":"R. Kirk","year":"2008","unstructured":"Kirk R., Wang H.: Largest number of subtrees of trees with a given maximum degree. SIAM J. Discrete Math. 22, 985\u2013995 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"1383_CR7","doi-asserted-by":"crossref","unstructured":"Knudsen, B.: Optimal multiple parsimony alignment with affine gap cost using a phylogenetic tree. In: Lecture Notes in Bioinformatics, vol. 2812, pp. 433\u2013446. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-39763-2_31"},{"key":"1383_CR8","first-page":"305","volume":"16","author":"A. Meir","year":"1983","unstructured":"Meir A., Moon J.W.: On subtrees of certain families of rooted trees. Ars. Combin. 16, 305\u2013318 (1983)","journal-title":"Ars. Combin."},{"issue":"1","key":"1383_CR9","first-page":"18","volume":"6","author":"R. Shi","year":"1993","unstructured":"Shi R.: The average distance of trees. Syst. Sci. Math. Sci. 6(1), 18\u201324 (1993)","journal-title":"Syst. Sci. Math. Sci."},{"key":"1383_CR10","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.aam.2004.07.002","volume":"34","author":"L.A. Sz\u00e9kely","year":"2005","unstructured":"Sz\u00e9kely L.A., Wang H.: On subtrees of trees. Adv. Appl. Math. 34, 138\u2013155 (2005)","journal-title":"Adv. Appl. Math."},{"key":"1383_CR11","first-page":"147","volume":"177","author":"L.A. Sz\u00e9kely","year":"2005","unstructured":"Sz\u00e9kely L.A., Wang H.: Binary trees with the largest number of subtrees with at least one leaf. Congr Numer. 177, 147\u2013169 (2005)","journal-title":"Congr Numer."},{"key":"1383_CR12","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.dam.2006.05.008","volume":"155","author":"L.A. Sz\u00e9kely","year":"2007","unstructured":"Sz\u00e9kely L.A., Wang H.: Binary trees with the largest number of subtrees. Discrete Appl. Math. 155, 374\u2013385 (2007)","journal-title":"Discrete Appl. Math."},{"key":"1383_CR13","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1016\/j.disc.2010.06.005","volume":"311","author":"L.A. Sz\u00e9kely","year":"2011","unstructured":"Sz\u00e9kely L.A., Wang H., Wu T.Y.: The sum of the distances between the leaves of a tree and the \u201csemi-regular\u201d property. Discrete Math. 311, 1197\u20131203 (2011)","journal-title":"Discrete Math."},{"key":"1383_CR14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.jctb.2009.05.006","volume":"100","author":"A. Vince","year":"2010","unstructured":"Vince A., Wang H.: The average order of a subtree of a tree. J. Combin. Theory Ser. B. 100, 161\u2013170 (2010)","journal-title":"J. Combin. Theory Ser. B."},{"key":"1383_CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/050631446","volume":"21","author":"S.G. Wagner","year":"2007","unstructured":"Wagner S.G.: Correlation of graph-theoretical indeces. SIAM J. Discrete Math. 21, 33\u201346 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"1383_CR16","doi-asserted-by":"crossref","first-page":"2647","DOI":"10.1016\/j.dam.2007.11.005","volume":"156","author":"H. Wang","year":"2008","unstructured":"Wang H.: The extremal values of the Wiener index of a tree with given degree sequence. Discrete Appl Math. 156, 2647\u20132654 (2008)","journal-title":"Discrete Appl Math."},{"key":"1383_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1021\/ja01193a005","volume":"69","author":"H. Wiener","year":"1947","unstructured":"Wiener H.: Structural determination of paraffin boiling poiling points. J. Am. Chem. Soc. 69, 17\u201320 (1947)","journal-title":"J. Am. Chem. Soc."},{"key":"1383_CR18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/j.tcs.2006.09.002","volume":"369","author":"W.G. Yan","year":"2006","unstructured":"Yan W.G., Yeh Y.N.: Enumeration of subtrees of trees. Theoret. Comput. Sci. 369, 256\u2013268 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"1383_CR19","first-page":"623","volume":"60","author":"X.D. Zhang","year":"2008","unstructured":"Zhang X.D., Xiang Q.Y., Xu L.Q., Pan R.Y.: The Wiener Index of trees with given degree sequences. MATCH Commun. Math. Comput. Chem. 60, 623\u2013644 (2008)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"1383_CR20","first-page":"661","volume":"64","author":"X.D. Zhang","year":"2010","unstructured":"Zhang X.D., Liu Y., Han M.X.: Maximum Wiener index of trees with given degree sequence. MATCH Commun. Math. Comput. Chem. 64, 661\u2013682 (2010)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"issue":"2","key":"1383_CR21","doi-asserted-by":"crossref","first-page":"207","DOI":"10.4310\/JOC.2012.v3.n2.a5","volume":"3","author":"X.M. Zhang","year":"2012","unstructured":"Zhang X.M., Zhang X.D., Gray D., Wang H.: Trees with the most subtrees\u2014an algorithmic approach. J. Combin. 3(2), 207\u2013223 (2012)","journal-title":"J. Combin."},{"key":"1383_CR22","doi-asserted-by":"crossref","unstructured":"Zhang, X.M., Zhang, X.D., Gray, D., Wang H.: The number of subtrees with given degree sequence. J. Graph Theory 73, 280\u2013295 (2013)","DOI":"10.1002\/jgt.21674"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1383-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1383-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1383-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T15:50:13Z","timestamp":1564933813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1383-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,7]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["1383"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1383-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,7]]}}}