{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T16:25:04Z","timestamp":1776270304431,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T00:00:00Z","timestamp":1713312000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T00:00:00Z","timestamp":1713312000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271251"],"award-info":[{"award-number":["12271251"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00373-024-02783-8","type":"journal-article","created":{"date-parts":[[2024,4,17]],"date-time":"2024-04-17T10:22:15Z","timestamp":1713349335000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Computing the Number and Average Size of Connected Sets in Planar 3-Trees"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6062-6054","authenticated-orcid":false,"given":"Zuwen","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kexiang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,17]]},"reference":[{"key":"2783_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/S0021-9800(69)80120-1","volume":"6","author":"LW Beineke","year":"1969","unstructured":"Beineke, L.W., Pippert, R.E.: The number of labeled $$k$$-dimensional trees. J. Comb. Theory 6, 200\u2013205 (1969)","journal-title":"J. Comb. Theory"},{"key":"2783_CR2","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s00373-020-02264-8","volume":"37","author":"A Bickle","year":"2021","unstructured":"Bickle, A., Che, Z.: Wiener indices of maximal $$k$$-degenerate graphs. Graphs Combin. 37, 581\u2013589 (2021)","journal-title":"Graphs Combin."},{"key":"2783_CR3","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.comgeo.2012.09.004","volume":"46","author":"T Biedl","year":"2013","unstructured":"Biedl, T., Ruiz Velazquez, L.E.: Drawing planar 3-trees with given face areas. Comput. Geom. 46, 276\u2013285 (2013)","journal-title":"Comput. Geom."},{"key":"2783_CR4","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics, vol. 244. Springer, New York (2008)"},{"key":"2783_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.dam.2018.11.026","volume":"258","author":"Z Che","year":"2018","unstructured":"Che, Z., Collins, K.: An upper bound on Wiener indices of maximal planar graphs. Discr. Appl. Math. 258, 76\u201386 (2018)","journal-title":"Discr. Appl. Math."},{"key":"2783_CR6","unstructured":"de Ridder, H.N. et al.: Information\u00a0system\u00a0on\u00a0graph\u00a0classes\u00a0and\u00a0their\u00a0inclusions (ISGCI). https:\/\/www.graphclasses.org 2001\u20132022 updated 22 Feb (2022)"},{"key":"2783_CR7","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/jgt.22793","volume":"100","author":"J Haslegrave","year":"2022","unstructured":"Haslegrave, J.: The number and average size of connected sets in graphs with degree constraints. J. Graph Theory 100, 530\u2013542 (2022)","journal-title":"J. Graph Theory"},{"key":"2783_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0095-8956(83)90049-7","volume":"35","author":"R Jamison","year":"1983","unstructured":"Jamison, R.: On the average number of nodes in a subtree of a tree. J. Combin. Theory Ser. B 35, 207\u2013223 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2783_CR9","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/0095-8956(84)90046-7","volume":"37","author":"R Jamison","year":"1984","unstructured":"Jamison, R.: Monotonicity of the mean order of subtrees. J. Combin. Theory Ser. B 37, 70\u201378 (1984)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2783_CR10","doi-asserted-by":"publisher","first-page":"P4.34","DOI":"10.37236\/7462","volume":"25","author":"K Kangas","year":"2018","unstructured":"Kangas, K., Kaski, P., Korhonen, J.H., Koivisto, M.: On the number of connected sets in bounded degree graphs. Electron. J. Combin. 25, P4.34 (2018)","journal-title":"Electron. J. Combin."},{"key":"2783_CR11","doi-asserted-by":"publisher","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":"2783_CR12","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1002\/jgt.22885","volume":"102","author":"Z Luo","year":"2023","unstructured":"Luo, Z., Xu, K., Wagner, S., Wang, H.: On the mean subtree order of trees under edge contraction. J. Graph Theory 102, 535\u2013551 (2023)","journal-title":"J. Graph Theory"},{"key":"2783_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2022.106302","volume":"178","author":"A Poureidi","year":"2022","unstructured":"Poureidi, A.: On computing the number of (BC-)subtrees, eccentric subtree number, and global and local means of trees. Inform. Process. Lett. 178, 106302 (2022)","journal-title":"Inform. Process. Lett."},{"key":"2783_CR14","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"2783_CR15","volume":"434","author":"D Sun","year":"2022","unstructured":"Sun, D., Li, L., Liu, K., Wang, H., Yang, Y.: Enumeration of subtrees of planar two-tree networks. Appl. Math. Comput. 434, 127404 (2022)","journal-title":"Appl. Math. Comput."},{"key":"2783_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1137\/0220009","volume":"20","author":"K Sutner","year":"1991","unstructured":"Sutner, K., Satyanarayana, A., Suffel, C.: The complexity of the residual node connectedness reliability problem. SIAM J. Comput. 20, 149\u2013155 (1991)","journal-title":"SIAM J. Comput."},{"key":"2783_CR17","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.aam.2004.07.002","volume":"34","author":"LA 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":"2783_CR18","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.dam.2006.05.008","volume":"155","author":"LA Sz\u00e9kely","year":"2006","unstructured":"Sz\u00e9kely, L.A., Wang, H.: Binary trees with the largest number of subtrees. Discr. Appl. Math. 155, 374\u2013385 (2006)","journal-title":"Discr. Appl. Math."},{"key":"2783_CR19","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.jctb.2021.09.008","volume":"152","author":"A Vince","year":"2022","unstructured":"Vince, A.: A lower bound on the average size of a connected vertex set of a graph. J. Combin. Theory Ser. B 152, 153\u2013170 (2022)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2783_CR20","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1002\/jgt.22643","volume":"97","author":"A Vince","year":"2020","unstructured":"Vince, A.: The average size of a connected vertex set of a graph-Explicit formulas and open problems. J. Graph Theory 97, 82\u2013103 (2020)","journal-title":"J. Graph Theory"},{"key":"2783_CR21","first-page":"281","volume":"67","author":"A Vince","year":"2017","unstructured":"Vince, A.: Counting connected sets and connected partitions of a graph. Australas. J. Combin. 67, 281\u2013293 (2017)","journal-title":"Australas. J. Combin."},{"key":"2783_CR22","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. Combin. Theory Ser. B 100, 161\u2013170 (2010)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2783_CR23","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/050631446","volume":"21","author":"S Wagner","year":"2007","unstructured":"Wagner, S.: Correlation of graph-theoretical indices. SIAM J. Discr. Math. 21, 33\u201346 (2007)","journal-title":"SIAM J. Discr. Math."},{"key":"2783_CR24","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, 154\u2013166 (2016)","journal-title":"J. Graph Theory"},{"key":"2783_CR25","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.dam.2021.08.009","volume":"304","author":"K Xu","year":"2021","unstructured":"Xu, K., Li, J., Wang, H.: The number of subtrees in graphs with given number of cut edges. Discr. Appl. Math. 304, 283\u2013296 (2021)","journal-title":"Discr. Appl. Math."},{"key":"2783_CR26","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.tcs.2006.09.002","volume":"369","author":"W Yan","year":"2006","unstructured":"Yan, W., Yeh, Y.N.: Enumeration of subtrees of trees. Theor. Comput. Sci. 369, 256\u2013268 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"2783_CR27","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1093\/comjnl\/bxaa084","volume":"65","author":"Y Yang","year":"2022","unstructured":"Yang, Y., Chen, B., Zhang, G., Li, Y., Sun, D., Liu, H.: Algorithms based on path contraction carrying weights for enumerating subtrees of tricyclic graphs. Comput. J. 65, 554\u2013572 (2022)","journal-title":"Comput. J."},{"key":"2783_CR28","first-page":"690","volume":"60","author":"Y Yang","year":"2017","unstructured":"Yang, Y., Liu, H., Wang, H., Deng, A., Magnant, C.: On algorithms for enumerating subtrees of hexagonal and phenylene chains. Comput. J. 60, 690\u2013710 (2017)","journal-title":"Comput. J."},{"key":"2783_CR29","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.dam.2014.01.015","volume":"169","author":"Z Zhang","year":"2014","unstructured":"Zhang, Z., Wu, B., Comellas, F.: The number of spanning trees in Apollonian networks. Discr. Appl. Math. 169, 206\u2013213 (2014)","journal-title":"Discr. Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02783-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02783-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02783-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T04:03:56Z","timestamp":1721707436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02783-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,17]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2783"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02783-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,17]]},"assertion":[{"value":"14 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"55"}}