{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,2]],"date-time":"2026-08-02T06:20:44Z","timestamp":1785651644317,"version":"3.56.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T00:00:00Z","timestamp":1765756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T00:00:00Z","timestamp":1765756800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006109","name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara M\u0160VVa\u0160 SR a SAV","doi-asserted-by":"publisher","award":["1\/0069\/23"],"award-info":[{"award-number":["1\/0069\/23"]}],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006109","name":"Vedeck\u00e1 Grantov\u00e1 Agent\u00fara M\u0160VVa\u0160 SR a SAV","doi-asserted-by":"publisher","award":["1\/0011\/25"],"award-info":[{"award-number":["1\/0011\/25"]}],"id":[{"id":"10.13039\/501100006109","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005357","name":"Agent\u00fa na Podporu V\u00fdskumu a V\u00fdvoja","doi-asserted-by":"publisher","award":["APVV-22-0005"],"award-info":[{"award-number":["APVV-22-0005"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005357","name":"Agent\u00fa na Podporu V\u00fdskumu a V\u00fdvoja","doi-asserted-by":"publisher","award":["APVV-23-0076"],"award-info":[{"award-number":["APVV-23-0076"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P1-0383"],"award-info":[{"award-number":["P1-0383"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P1-0383"],"award-info":[{"award-number":["P1-0383"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["J1-3002"],"award-info":[{"award-number":["J1-3002"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["J1-3002"],"award-info":[{"award-number":["J1-3002"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["KK.01.1.1.02.0027"],"award-info":[{"award-number":["KK.01.1.1.02.0027"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100015526","name":"Ministarstvo znanosti i obrazovanja","doi-asserted-by":"publisher","award":["BI-HR\/25-27-004"],"award-info":[{"award-number":["BI-HR\/25-27-004"]}],"id":[{"id":"10.13039\/100015526","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["BI-HR\/25-27-004"],"award-info":[{"award-number":["BI-HR\/25-27-004"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Scientific and Technological Project of Henan Province","award":["242102521023"],"award-info":[{"award-number":["242102521023"]}]},{"name":"Key Scientific and Technological Project of Henan Province","award":["252102521077"],"award-info":[{"award-number":["252102521077"]}]},{"name":"Key Scientific and Technological Project of Henan Province","award":["252102240118"],"award-info":[{"award-number":["252102240118"]}]},{"name":"China Henan International Joint Laboratory for Multidimensional Topol- ogy and Carcinogenic Characteristics Analysis of Atmospheric ParticulateMatter","award":["PM2.5"],"award-info":[{"award-number":["PM2.5"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    The subpath number of a graph\n                    <jats:italic>G<\/jats:italic>\n                    is defined as the total number of subpaths in\n                    <jats:italic>G<\/jats:italic>\n                    , and it is closely related to the number of subtrees, a well-studied topic in graph theory. This paper is a continuation of our previous paper Knor et al. (Knor M, Sedlar J, \u0160krekovski R, et al (2026) Invitation to the subpath number[J]. Appl Math Comput 509:129646), where we investigated the subpath number and identified extremal graphs within the classes of trees, unicyclic graphs, bipartite graphs, and cycle chains. Here, we focus on the subpath number of cactus graphs and characterize all maximal and minimal cacti with\n                    <jats:italic>n<\/jats:italic>\n                    vertices and\n                    <jats:italic>k<\/jats:italic>\n                    cycles. We prove that maximal cacti are cycle chains in which all interior cycles are triangles, while the two end-cycles differ in length by at most one. In contrast, the minimal cacti consist of\n                    <jats:italic>k<\/jats:italic>\n                    cycles, all of which are end-triangles, with the subgraph induced by the remaining vertices forming a forest. By comparing extremal cacti with respect to the subpath number to those that are extremal for the subtree number and the Wiener index, we demonstrate that the subpath number does not correlate with either of these quantities, as their corresponding extremal graphs differ.\n                  <\/jats:p>","DOI":"10.1007\/s40314-025-03545-9","type":"journal-article","created":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T12:41:41Z","timestamp":1765802501000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["The subpath number of cactus graphs"],"prefix":"10.1007","volume":"45","author":[{"given":"Martin","family":"Knor","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jelena","family":"Sedlar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Riste","family":"\u0160krekovski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,15]]},"reference":[{"issue":"15","key":"3545_CR1","doi-asserted-by":"publisher","first-page":"3314","DOI":"10.1016\/j.dam.2009.07.004","volume":"157","author":"\u00c9 Czabarka","year":"2009","unstructured":"Czabarka \u00c9, Sz\u00e9kely L, Wagner S (2009) The inverse problem for certain tree parameters. Discrete Appl Math 157(15):3314\u20133319","journal-title":"Discrete Appl Math"},{"issue":"4","key":"3545_CR2","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1002\/jgt.22943","volume":"103","author":"Y Chen","year":"2023","unstructured":"Chen Y, Lin X, Zhang X (2023) The extremal average distance of cubic graphs. J Graph Theory 103(4):713\u2013739","journal-title":"J Graph Theory"},{"key":"3545_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.dam.2017.07.023","volume":"232","author":"I Gutman","year":"2017","unstructured":"Gutman I, Li S, Wei W (2017) Cacti with n-vertices and t cycles having extremal Wiener index. Discrete Appl Math 232:189\u2013200","journal-title":"Discrete Appl Math"},{"key":"3545_CR4","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1137\/070687736","volume":"22","author":"R Kirk","year":"2008","unstructured":"Kirk R, Wang H (2008) Largest number of subtrees of trees with a given maximum degree. SIAM J Discrete Math 22:985\u2013995","journal-title":"SIAM J Discrete Math"},{"key":"3545_CR5","doi-asserted-by":"crossref","unstructured":"Knor M, Sedlar J, \u0160krekovski R, et al (2026) Invitation to the subpath number[J]. Appl Math Comput 509:129646","DOI":"10.1016\/j.amc.2025.129646"},{"key":"3545_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.26493\/1855-3974.795.ebf","volume":"11","author":"M Knor","year":"2016","unstructured":"Knor M, \u0160krekovski R, Tepeh A (2016) Mathematical aspects of Wiener index. Ars Math Contemp 11:327\u2013352","journal-title":"Ars Math Contemp"},{"key":"3545_CR7","doi-asserted-by":"publisher","DOI":"10.26493\/1855-3974.3077.63a","author":"M Knor","year":"2024","unstructured":"Knor M, \u0160krekovski R, Tepeh A (2024) Selected topics on Wiener index. Ars Math Contemp. https:\/\/doi.org\/10.26493\/1855-3974.3077.63a","journal-title":"Ars Math Contemp"},{"key":"3545_CR8","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1007\/s00010-022-00879-1","volume":"96","author":"J Li","year":"2022","unstructured":"Li J, Xu K, Zhang T, Wang H, Wagner S (2022) Maximum number of subtrees in cacti and block graphs. Aequat Math 96:1027\u20131040","journal-title":"Aequat Math"},{"key":"3545_CR9","first-page":"193","volume":"58","author":"H Liu","year":"2007","unstructured":"Liu H, Lu M (2007) A unified approach to cacti for different indices. MATCH Commun Math Comput Chem 58:193\u2013204","journal-title":"MATCH Commun Math Comput Chem"},{"key":"3545_CR10","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 LA, Wang H (2005) On subtrees of trees. Adv Appl Math 34:138\u2013155","journal-title":"Adv Appl Math"},{"key":"3545_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.dam.2006.05.008","volume":"155","author":"LA Sz\u00e9kely","year":"2007","unstructured":"Sz\u00e9kely LA, Wang H (2007) Binary trees with the largest number of subtrees. Discrete Appl Math 155:374\u2013385","journal-title":"Discrete Appl Math"},{"key":"3545_CR12","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1021\/ja01193a005","volume":"69","author":"H Wiener","year":"1947","unstructured":"Wiener H (1947) Structural determination of paraffin boiling points. J Amer Chem Soc 69:17\u201320","journal-title":"J Amer Chem Soc"},{"key":"3545_CR13","doi-asserted-by":"publisher","first-page":"2495","DOI":"10.1051\/ro\/2022118","volume":"56","author":"K Xu","year":"2022","unstructured":"Xu K, Li J, Luo Z (2022) Comparative results between the number of subtrees and Wiener index of graphs. RAIRO Oper Res 56:2495\u20132511","journal-title":"RAIRO Oper Res"},{"key":"3545_CR14","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 (2021) The number of subtrees in graphs with given number of cut edges. Discrete Appl Math 304:283\u2013296","journal-title":"Discrete Appl Math"},{"key":"3545_CR15","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.dam.2016.09.002","volume":"217","author":"M Yamamoto","year":"2009","unstructured":"Yamamoto M (2009) Approximately counting paths and cycles in a graph. Discrete Appl Math 217:381\u2013387","journal-title":"Discrete Appl Math"},{"key":"3545_CR16","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.tcs.2021.09.024","volume":"892","author":"Y Yang","year":"2021","unstructured":"Yang Y, Li X-X, Jin M-Y, Li L, Wang H, Zhang X-D (2021) Enumeration of subtrees and BC-subtrees with maximum degree no more than k in trees. Theor Comput Sci 892:258\u2013278","journal-title":"Theor Comput Sci"},{"key":"3545_CR17","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/j.dam.2020.06.013","volume":"285","author":"Y Yang","year":"2020","unstructured":"Yang Y, Sun X-J, Cao J-Y, Wang H, Zhang X-D (2020) The expected subtree number index in random polyphenylene and spiro chains. Discrete Appl Math 285:483\u2013492","journal-title":"Discrete Appl Math"},{"key":"3545_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2022.104942","volume":"289","author":"Y Yang","year":"2022","unstructured":"Yang Y, Liu H, Wang H, Zhang X-D, Chen CP (2022) On enumerating algorithms of novel multiple leaf-distance granular regular $$\\alpha $$-subtrees of trees. Inf Comput 289:104942","journal-title":"Inf Comput"},{"key":"3545_CR19","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1002\/jgt.21674","volume":"73","author":"XM Zhang","year":"2013","unstructured":"Zhang XM, Zhang XD, Gray D, Wang H (2013) The number of subtrees of trees with given degree sequence. J Graph Theory 73:280\u2013295","journal-title":"J Graph Theory"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03545-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03545-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03545-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T00:37:09Z","timestamp":1777336629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03545-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,15]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3545"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03545-9","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,15]]},"assertion":[{"value":"21 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 December 2025","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 known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"102"}}