{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T16:50:28Z","timestamp":1772729428185,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,8]],"date-time":"2020-02-08T00:00:00Z","timestamp":1581120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,8]],"date-time":"2020-02-08T00:00:00Z","timestamp":1581120000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Research Foundation of South Africa","award":["96236"],"award-info":[{"award-number":["96236"]}]},{"name":"National Research Foundation of South Africa","award":["96310"],"award-info":[{"award-number":["96310"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00373-020-02136-1","type":"journal-article","created":{"date-parts":[[2020,2,8]],"date-time":"2020-02-08T17:02:26Z","timestamp":1581181346000},"page":"539-560","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["The Average Size of Matchings in Graphs"],"prefix":"10.1007","volume":"36","author":[{"given":"Eric O. D.","family":"Andriantiana","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6046-012X","authenticated-orcid":false,"given":"Valisoa","family":"Razanajatovo Misanantenaina","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Wagner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,8]]},"reference":[{"key":"2136_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/s40879-019-00333-8","author":"EOD Andriantiana","year":"2019","unstructured":"Andriantiana, E.O.D., Razanajatovo Misanantenaina, V., Wagner, S.: The average size of independent sets in a graph. Eur. J. Math. (2019). https:\/\/doi.org\/10.1007\/s40879-019-00333-8","journal-title":"Eur. J. Math."},{"issue":"1","key":"2136_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1112\/jlms.12056","volume":"96","author":"E Davies","year":"2017","unstructured":"Davies, E., Jenssen, M., Perkins, W., Roberts, B.: Independent sets, matchings, and occupancy fractions. J. Lond. Math. Soc. 96(1), 47\u201366 (2017)","journal-title":"J. Lond. Math. Soc."},{"key":"2136_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"issue":"15","key":"2136_CR4","doi-asserted-by":"publisher","first-page":"2177","DOI":"10.1016\/j.dam.2012.06.001","volume":"160","author":"I Gutman","year":"2012","unstructured":"Gutman, I., Wagner, S.: The matching energy of a graph. Discrete Appl. Math. 160(15), 2177\u20132187 (2012)","journal-title":"Discrete Appl. Math."},{"key":"2136_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.jctb.2014.02.003","volume":"107","author":"J Haslegrave","year":"2014","unstructured":"Haslegrave, J.: Extremal results on average subtree density of series-reduced trees. J. Comb. Theory Ser. B 107, 26\u201341 (2014)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"2136_CR6","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0095-8956(83)90049-7","volume":"35","author":"RE Jamison","year":"1983","unstructured":"Jamison, R.E.: On the average number of nodes in a subtree of a tree. J. Comb. Theory Ser. B 35(3), 207\u2013223 (1983)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"2136_CR7","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/0095-8956(84)90046-7","volume":"37","author":"RE Jamison","year":"1984","unstructured":"Jamison, R.E.: Monotonicity of the mean order of subtrees. J. Comb. Theory Ser. B 37(1), 70\u201378 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2136_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-4220-2","volume-title":"Graph Energy","author":"X Li","year":"2012","unstructured":"Li, X., Shi, Y., Gutman, I.: Graph Energy. Springer Science & Business Media, Berlin (2012)"},{"key":"2136_CR9","volume-title":"Matching Theory, volume 121 of North-Holland Mathematics Studies. Annals of Discrete Mathematics","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz, L., Plummer, M.D.: Matching Theory, volume 121 of North-Holland Mathematics Studies. Annals of Discrete Mathematics, vol. 29. North-Holland Publishing Co., Amsterdam (1986)"},{"key":"2136_CR10","unstructured":"Mol, L., Oellermann, O.: Maximizing the mean subtree order. J. Graph Theory (To appear)"},{"key":"2136_CR11","unstructured":"Razanajatovo\u00a0Misanantenaina, V.: Properties of graph polynomials and related parameters. Ph.D. thesis, Stellenbosch University (2017)"},{"issue":"2","key":"2136_CR12","doi-asserted-by":"publisher","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. Comb. Theory Ser. B 100(2), 161\u2013170 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2136_CR13","first-page":"155","volume-title":"Bounds in Chemical Graph Theory\u2014basics, volume\u00a019 of Mathematical Chemistry Monographs","author":"S Wagner","year":"2017","unstructured":"Wagner, S.: Upper and lower bounds for Merrifield\u2013Simmons index and Hosoya index. In: Gutman, I., Furtula, B., Das, K.C., Milovanovi\u0107, E., Milovanovi\u0107, I. (eds.) Bounds in Chemical Graph Theory\u2014basics, volume\u00a019 of Mathematical Chemistry Monographs, pp. 155\u2013187. University of Kragujevac and Faculty of Science, Kragujevac (2017)"},{"issue":"2","key":"2136_CR14","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1002\/jgt.21869","volume":"81","author":"S Wagner","year":"2016","unstructured":"Wagner, S., Wang, H.: On the local and global means of subtree orders. J. Graph Theory 81(2), 154\u2013166 (2016)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02136-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02136-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02136-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T02:59:07Z","timestamp":1612839547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02136-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,8]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2136"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02136-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,8]]},"assertion":[{"value":"24 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}