{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:59:39Z","timestamp":1775717979161,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T00:00:00Z","timestamp":1770768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T00:00:00Z","timestamp":1770768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s00373-026-03019-7","type":"journal-article","created":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:50:18Z","timestamp":1770814218000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Counting Spanning Trees with One Perfect Matching in Helicene Polygonal Chains on the Plane and Cylinder"],"prefix":"10.1007","volume":"42","author":[{"given":"Sujing","family":"Cheng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8323-5558","authenticated-orcid":false,"given":"Jun","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,11]]},"reference":[{"key":"3019_CR1","volume-title":"Algebraic Graph Theory","author":"N Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1993)"},{"key":"3019_CR2","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1007\/s10801-022-01131-4","volume":"56","author":"SJ Cheng","year":"2022","unstructured":"Cheng, S.J., Chen, W.X., Yan, W.G.: Counting spanning trees in almost complete multipartite graphs. J. Algebr. Comb. 56, 773\u2013783 (2022)","journal-title":"J. Algebr. Comb."},{"key":"3019_CR3","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1039\/b806203j","volume":"38","author":"J Crassous","year":"2009","unstructured":"Crassous, J.: Chiral transfer in coordination complexes: towards molecular materials. Chem. Soc. Rev. 38, 830\u2013845 (2009)","journal-title":"Chem. Soc. Rev."},{"key":"3019_CR4","volume-title":"Circulant Matrices","author":"PJ Davis","year":"1979","unstructured":"Davis, P.J.: Circulant Matrices. Wiley, New York (1979)"},{"key":"3019_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/jgt.22812","volume":"101","author":"FM Dong","year":"2022","unstructured":"Dong, F.M., Ge, J.: Counting spanning trees in a complete bipartite graph which contain a given spanning forest. J. Graph Theory 101, 79\u201394 (2022)","journal-title":"J. Graph Theory"},{"key":"3019_CR6","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1002\/jgt.22048","volume":"85","author":"FM Dong","year":"2017","unstructured":"Dong, F.M., Yan, W.G.: Expression for the number of spanning trees of line graphs of arbitrary connected graphs. J. Graph Theory 85, 74\u201393 (2017)","journal-title":"J. Graph Theory"},{"key":"3019_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ejc.2019.05.008","volume":"81","author":"M Dukes","year":"2019","unstructured":"Dukes, M., Selig, T., Smith, J.P.: The Abelian sandpile model on Ferrers graphs - a classification of recurrent configurations. Europ. J. Combin. 81, 221\u2013241 (2019)","journal-title":"Europ. J. Combin."},{"key":"3019_CR8","doi-asserted-by":"publisher","first-page":"6073","DOI":"10.1090\/S0002-9947-09-04898-3","volume":"361","author":"AM Duval","year":"2009","unstructured":"Duval, A.M., Klivans, C.J., Martin, J.L.: Simplicial matrix-tree theorem. Trans. Amer. Math. Soc. 361, 6073\u20136114 (2009)","journal-title":"Trans. Amer. Math. Soc."},{"key":"3019_CR9","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/s00454-004-1135-1","volume":"32","author":"R Ehrenborg","year":"2004","unstructured":"Ehrenborg, R., Willigenburg, S.V.: Enumerative properties of Ferrers graphs. Discrete Comput. Geom. 32, 481\u2013492 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"3019_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.dam.2021.09.008","volume":"305","author":"J Ge","year":"2021","unstructured":"Ge, J.: Effective resistance and spanning trees in the complete bipartite graph plus a matching. Discrete Appl. Math. 305, 145\u2013153 (2021)","journal-title":"Discrete Appl. Math."},{"key":"3019_CR11","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/j.dam.2020.02.002","volume":"283","author":"J Ge","year":"2020","unstructured":"Ge, J., Dong, F.: Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs. Discrete Appl. Math. 283, 542\u2013554 (2020)","journal-title":"Discrete Appl. Math."},{"key":"3019_CR12","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s10801-024-01341-y","volume":"60","author":"H Gong","year":"2024","unstructured":"Gong, H., Gong, Y., Ge, J.: The number of spanning trees in $$K_n$$-complement of a bipartite graph. J. Alg. Combin. 60, 541\u2013554 (2024)","journal-title":"J. Alg. Combin."},{"key":"3019_CR13","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1002\/jgt.22212","volume":"88","author":"H Gong","year":"2018","unstructured":"Gong, H., Jin, X.: A formula for the number of the spanning trees of line graphs. J. Graph Theory 88, 294\u2013301 (2018)","journal-title":"J. Graph Theory"},{"key":"3019_CR14","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.dam.2017.05.003","volume":"229","author":"H Gong","year":"2017","unstructured":"Gong, H., Li, S.: The number of spanning trees of a family of 2-separable weighted graphs. Discrete Appl. Math. 229, 154\u2013160 (2017)","journal-title":"Discrete Appl. Math."},{"key":"3019_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2025.114514","volume":"348","author":"S Gong","year":"2025","unstructured":"Gong, S., Xu, Y., Zou, P., Wang, J.: On bipartite graphs with the minimum number of spanning trees. Discrete Math. 348, 114514 (2025)","journal-title":"Discrete Math."},{"key":"3019_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.commatsci.2021.110332","volume":"195","author":"WY Gong","year":"2021","unstructured":"Gong, W.Y., Yan, Q.M.: Graph-based deep learning frameworks for molecules and solid-state materials. Comp. Mater. Sci. 195, 110332 (2021)","journal-title":"Comp. Mater. Sci."},{"key":"3019_CR17","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.cam.2018.05.045","volume":"344","author":"C He","year":"2018","unstructured":"He, C., Li, S., Luo, W., Sun, L.: Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains. J. Comput. Appl. Math. 344, 381\u2013393 (2018)","journal-title":"J. Comput. Appl. Math."},{"key":"3019_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.laa.2019.08.009","volume":"582","author":"S Klee","year":"2019","unstructured":"Klee, S., Stamps, M.T.: Linear algebraic techniques for weighted spanning tree enumeration. Linear Alg. Appl. 582, 391\u2013402 (2019)","journal-title":"Linear Alg. Appl."},{"key":"3019_CR19","volume":"479","author":"JC Lai","year":"2024","unstructured":"Lai, J.C., Zhu, R.K.: Enumeration of spanning trees containing a perfect matching in linear polygonal chains. Appl. Math. Comput. 479, 128882 (2024)","journal-title":"Appl. Math. Comput."},{"key":"3019_CR20","volume":"456","author":"DY Li","year":"2023","unstructured":"Li, D.Y., Yan, W.G.: Counting spanning trees with a kekul\u00e9 structure in linear hexagonal chains. Appl. Math. Comput. 456, 128125 (2023)","journal-title":"Appl. Math. Comput."},{"key":"3019_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1002\/jgt.23220","volume":"109","author":"DY Li","year":"2025","unstructured":"Li, D.Y., Yan, W.G.: A variant of the Teufl and Wagner\u2019s formula and applications. J. Graph Theory 109, 68\u201375 (2025)","journal-title":"J. Graph Theory"},{"key":"3019_CR22","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.dam.2024.07.026","volume":"358","author":"DY Li","year":"2024","unstructured":"Li, D.Y., Feng, X., Yan, W.G.: Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and M\u00f6bius strip. Discret. Appl. Math. 358, 320\u2013325 (2024)","journal-title":"Discret. Appl. Math."},{"key":"3019_CR23","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.dam.2023.09.022","volume":"342","author":"Q Ma","year":"2024","unstructured":"Ma, Q.: Extremal polygonal chains with respect to the Kirchhoff index. Discrete Appl. Math. 342, 218\u2013226 (2024)","journal-title":"Discrete Appl. Math."},{"key":"3019_CR24","volume":"475","author":"X Ma","year":"2024","unstructured":"Ma, X., Yang, Y.: Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink. Appl. Math. Comput. 475, 128722 (2024)","journal-title":"Appl. Math. Comput."},{"key":"3019_CR25","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1039\/C6CS00623J","volume":"46","author":"M Rickhaus","year":"2017","unstructured":"Rickhaus, M., Mayor, M., Juri\u010dek, M.: Chirality in curved polyaromatic systems. Chem. Soc. Rev. 46, 1643\u20131660 (2017)","journal-title":"Chem. Soc. Rev."},{"key":"3019_CR26","volume":"447","author":"L Shi","year":"2023","unstructured":"Shi, L., Deng, K.: Counting the maximal and perfect matchings in benzenoid chains. Appl. Math. Comput. 447, 127922 (2023)","journal-title":"Appl. Math. Comput."},{"key":"3019_CR27","doi-asserted-by":"publisher","first-page":"3881","DOI":"10.1088\/0305-4470\/33\/21\/303","volume":"33","author":"R Shrock","year":"2000","unstructured":"Shrock, R., Wu, F.Y.: Spanning trees on graphs and lattices in $$d$$ dimensions. J. Phys. A 33, 3881\u20133902 (2000)","journal-title":"J. Phys. A"},{"key":"3019_CR28","first-page":"47","volume":"45","author":"R Simion","year":"1984","unstructured":"Simion, R.: Trees with 1-factors: degree distribution. Congr. Numer. 45, 47\u2013159 (1984)","journal-title":"Congr. Numer."},{"key":"3019_CR29","volume":"437","author":"W Sun","year":"2023","unstructured":"Sun, W., Yang, Y.: Extremal pentagonal chains with respect to the Kirchhoff index. Appl. Math. Comput. 437, 127534 (2023)","journal-title":"Appl. Math. Comput."},{"key":"3019_CR30","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10801-020-00969-w","volume":"54","author":"J Zhou","year":"2021","unstructured":"Zhou, J., Bu, C.J.: The enumeration of spanning tree of weighted graphs. J. Alg. Combin. 54, 75\u2013108 (2021)","journal-title":"J. Alg. Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03019-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03019-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03019-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:15:34Z","timestamp":1775715334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03019-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,11]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3019"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03019-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,11]]},"assertion":[{"value":"24 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no conflicts of interests or competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"21"}}