{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T14:26:31Z","timestamp":1771079191348,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T00:00:00Z","timestamp":1677024000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T00:00:00Z","timestamp":1677024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2021JCYJ05"],"award-info":[{"award-number":["2021JCYJ05"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004772","name":"Natural Science Foundation of Ningxia","doi-asserted-by":"crossref","award":["2022AAC03285"],"award-info":[{"award-number":["2022AAC03285"]}],"id":[{"id":"10.13039\/501100004772","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12161002"],"award-info":[{"award-number":["12161002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s40314-023-02228-7","type":"journal-article","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T20:02:46Z","timestamp":1677096166000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Forcing and anti-forcing polynomials of a type of polyomino graphs"],"prefix":"10.1007","volume":"42","author":[{"given":"Kai","family":"Deng","sequence":"first","affiliation":[]},{"given":"Huazhong","family":"L\u00fc","sequence":"additional","affiliation":[]},{"given":"Tingzeng","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,22]]},"reference":[{"key":"2228_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disc.2002.10.002","volume":"281","author":"P Adams","year":"2004","unstructured":"Adams P, Mahdian M, Mahmoodian ES (2004) On the forced matching numbers of bipartite graphs. Discrete Math 281:1\u201312","journal-title":"Discrete Math"},{"key":"2228_CR2","first-page":"147","volume":"30","author":"P Afshani","year":"2004","unstructured":"Afshani P, Hatami H, Mahmoodian ES (2004) On the spectrum of the forced matching number of graphs. Australas J Combin 30:147\u2013160","journal-title":"Australas J Combin"},{"key":"2228_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-00892-8","volume-title":"Kekul\u00e9 structures in benzenoid hydrocarbons (Lecture notes in chemistry 46)","author":"SJ Cyvin","year":"1988","unstructured":"Cyvin SJ, Gutman I (1988) Kekul\u00e9 structures in benzenoid hydrocarbons (Lecture notes in chemistry 46). Springer, Berlin"},{"key":"2228_CR4","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/s10878-015-9986-3","volume":"33","author":"K Deng","year":"2017","unstructured":"Deng K, Zhang H (2017a) Anti-forcing spectra of perfect matchings of graphs. J Comb Optim 33:660\u2013680","journal-title":"J Comb Optim"},{"key":"2228_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.dam.2017.02.024","volume":"224","author":"K Deng","year":"2017","unstructured":"Deng K, Zhang H (2017b) Extremal anti-forcing numbers of perfect matchings of graphs. Discrete Appl Math 224:69\u201379","journal-title":"Discrete Appl Math"},{"key":"2228_CR6","first-page":"27","volume":"85","author":"K Deng","year":"2021","unstructured":"Deng K, Liu S, Zhou X (2021) Forcing and anti-Forcing polynomials of perfect matchings of a pyrene system. MATCH Commun Math Comput Chem 85:27\u201346","journal-title":"MATCH Commun Math Comput Chem"},{"key":"2228_CR7","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1016\/j.disc.2018.12.011","volume":"342","author":"AA Diwan","year":"2019","unstructured":"Diwan AA (2019) The minimum forcing number of perfect matchings in the hypercube. Discrete Math 342:1060\u20131062","journal-title":"Discrete Math"},{"key":"2228_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01192587","volume":"6","author":"F Harary","year":"1991","unstructured":"Harary F, Klein DJ, \u017divkovi\u0107 T (1991) Graphical properties of polyhexes: perfect matching vector and forcing. J Math Chem 6:295\u2013306","journal-title":"J Math Chem"},{"key":"2228_CR9","unstructured":"Hwang HK, Lei H, Yeh Y, Zhang H (2015) Distribution of forcing and anti-forcing numbers of random perfect matchings on hexagonal chains and crowns (preprint). http:\/\/140.109.74.92\/hk\/?p=873"},{"key":"2228_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s10910-015-0541-3","volume":"54","author":"X Jiang","year":"2016","unstructured":"Jiang X, Zhang H (2016) The maximum forcing number of cylindrical grid, toroidal 4\u20138 lattice and Klein bottle 4\u20138 lattice. J Math Chem 54:18\u201332","journal-title":"J Math Chem"},{"key":"2228_CR11","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1002\/jcc.540080432","volume":"8","author":"DJ Klein","year":"1987","unstructured":"Klein DJ, Randi\u0107 M (1987) Innate degree of freedom of a graph. J Comput Chem 8:516\u2013521","journal-title":"J Comput Chem"},{"key":"2228_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.5562\/cca2000","volume":"81","author":"DJ Klein","year":"2014","unstructured":"Klein DJ, Rosenfeld V (2014) Forcing, freedom and uniqueness in graph theory and chemistry. Croat Chem Acta 81:49\u201359","journal-title":"Croat Chem Acta"},{"key":"2228_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.dam.2015.08.024","volume":"202","author":"H Lei","year":"2016","unstructured":"Lei H, Yeh Y, Zhang H (2016) Anti-forcing numbers of perfect matchings of graphs. Discrete Appl Math 202:95\u2013105","journal-title":"Discrete Appl Math"},{"key":"2228_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0166-218X(95)00116-9","volume":"72","author":"X Li","year":"1997","unstructured":"Li X (1997) Hexagonal systems with forcing single edges. Discrete Appl Math 72:295\u2013301","journal-title":"Discrete Appl Math"},{"key":"2228_CR15","doi-asserted-by":"publisher","first-page":"561","DOI":"10.46793\/match.87-3.561L","volume":"87","author":"Y Liu","year":"2022","unstructured":"Liu Y, Ma C, Yao H, Wang X (2022) Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings. MATCH Commun Math Comput Chem 87:561\u2013575","journal-title":"MATCH Commun Math Comput Chem"},{"key":"2228_CR16","volume-title":"Matching Theory, Annals of Discrete Mathematics","author":"L Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L, Plummer M (1986) Matching Theory, Annals of Discrete Mathematics, vol 29. North-Holland, Amsterdam"},{"key":"2228_CR17","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"CL Lucchesi","year":"1978","unstructured":"Lucchesi CL, Younger DH (1978) A minimax theorem for directed graphs. J Lond Math Soc 17:369\u2013374","journal-title":"J Lond Math Soc"},{"key":"2228_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0012-365X(97)00266-5","volume":"190","author":"L Pachter","year":"1998","unstructured":"Pachter L, Kim P (1998) Forcing matchings on square grids. Discrete Math 190:287\u2013294","journal-title":"Discrete Math"},{"key":"2228_CR19","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0012-365X(01)00228-X","volume":"245","author":"ME Riddle","year":"2002","unstructured":"Riddle ME (2002) The minimum forcing number for the torus and hypercube. Discrete Math 245:283\u2013292","journal-title":"Discrete Math"},{"issue":"3","key":"2228_CR20","first-page":"9","volume":"19","author":"L Shi","year":"2017","unstructured":"Shi L, Zhang H (2017) Tight upper bound on the maximum anti-forcing numbers of graphs. Discrete Math Theor Comput Sci 19(3):9","journal-title":"Discrete Math Theor Comput Sci"},{"key":"2228_CR21","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.dam.2017.07.009","volume":"233","author":"L Shi","year":"2017","unstructured":"Shi L, Wang H, Zhang H (2017) On the maximum forcing and anti-forcing numbers of (4,6)-fullerenes. Discrete Appl Math 233:187\u2013194","journal-title":"Discrete Appl Math"},{"key":"2228_CR22","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.cplett.2004.11.098","volume":"401","author":"D Vuki\u010devi\u0107","year":"2005","unstructured":"Vuki\u010devi\u0107 D, Randi\u0107 M (2005) On Kekukl\u00e9 structures of buckminsterfullerene. Chem Phys Lett 401:446\u2013450","journal-title":"Chem Phys Lett"},{"key":"2228_CR23","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s10910-006-9133-6","volume":"42","author":"D Vuki\u010devi\u0107","year":"2007","unstructured":"Vuki\u010devi\u0107 D, Trinajsti\u00e9 N (2007) On the anti-forcing number of benzenoids. J Math Chem 42:575\u2013583","journal-title":"J Math Chem"},{"key":"2228_CR24","first-page":"493","volume":"70","author":"L Xu","year":"2013","unstructured":"Xu L, Bian H, Zhang F (2013) Maximum forcing number of hexagonal systems. MATCH Commun Math Comput Chem 70:493\u2013500","journal-title":"MATCH Commun Math Comput Chem"},{"key":"2228_CR25","first-page":"681","volume":"74","author":"Q Yang","year":"2015","unstructured":"Yang Q, Zhang H, Lin Y (2015) On the anti-forcing number of fullerene graphs. MATCH Commun Math Comput Chem 74:681\u2013700","journal-title":"MATCH Commun Math Comput Chem"},{"key":"2228_CR26","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10255-021-1010-3","volume":"37","author":"H Zhang","year":"2021","unstructured":"Zhang H, Jiang X (2021) Continuous forcing spectra of even polygonal chains. Acta Math Appl Sin English Ser 37:337\u2013347","journal-title":"Acta Math Appl Sin English Ser"},{"key":"2228_CR27","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0166-218X(00)00204-3","volume":"105","author":"H Zhang","year":"2000","unstructured":"Zhang H, Zhang F (2000) Plane elementary bipartite graphs. Discrete Appl Math 105:291\u2013311","journal-title":"Discrete Appl Math"},{"key":"2228_CR28","first-page":"13","volume":"85","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Zhang H (2021) The minimum forcing and anti-forcing numbers of convex hexagonal systems. MATCH Commun Math Comput Chem 85:13\u201325","journal-title":"MATCH Commun Math Comput Chem"},{"key":"2228_CR29","doi-asserted-by":"publisher","first-page":"323","DOI":"10.7151\/dmgt.1857","volume":"36","author":"H Zhang","year":"2016","unstructured":"Zhang H, Zhou X (2016) A maximum resonant set of polyomino graphs. Discuss Math Graph Theory 36:323\u2013337","journal-title":"Discuss Math Graph Theory"},{"key":"2228_CR30","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.dam.2009.10.013","volume":"158","author":"H Zhang","year":"2010","unstructured":"Zhang H, Ye D, Shiu WC (2010) Forcing matching numbers of fullerene graphs. Discrete Appl Math 158:573\u2013582","journal-title":"Discrete Appl Math"},{"key":"2228_CR31","first-page":"473","volume":"73","author":"H Zhang","year":"2015","unstructured":"Zhang H, Zhao S, Lin R (2015) The forcing polynomial of catacondensed hexagonal systems. MATCH Commun Math Comput Chem 73:473\u2013490","journal-title":"MATCH Commun Math Comput Chem"},{"key":"2228_CR32","doi-asserted-by":"publisher","first-page":"767","DOI":"10.46793\/match.88-3.767Z","volume":"88","author":"S Zhao","year":"2022","unstructured":"Zhao S (2022) Matching forcing polynomials of constructable hexagonal systems. MATCH Commun Math Comput Chem 88:767\u2013797","journal-title":"MATCH Commun Math Comput Chem"},{"key":"2228_CR33","doi-asserted-by":"publisher","DOI":"10.1080\/10406638.2022.2083193","author":"S Zhao","year":"2022","unstructured":"Zhao S, Fan X (2022) Forcing polynomial of double hexagonal chains. Polycycl Aromat Comput. https:\/\/doi.org\/10.1080\/10406638.2022.2083193","journal-title":"Polycycl Aromat Comput"},{"key":"2228_CR34","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.amc.2016.03.008","volume":"284","author":"S Zhao","year":"2016","unstructured":"Zhao S, Zhang H (2016) Forcing polynomials of benzenoid parallelogram and its related benzenoids. Appl Math Comput 284:209\u2013218","journal-title":"Appl Math Comput"},{"key":"2228_CR35","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.dam.2018.05.023","volume":"250","author":"S Zhao","year":"2018","unstructured":"Zhao S, Zhang H (2018) Anti-forcing polynomials for benzenoid systems with forcing edges. Discrete Appl Math 250:342\u2013356","journal-title":"Discrete Appl Math"},{"key":"2228_CR36","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s10910-018-0944-z","volume":"57","author":"S Zhao","year":"2019","unstructured":"Zhao S, Zhang H (2019) Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids. J Math Chem 57:202\u2013225","journal-title":"J Math Chem"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02228-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-023-02228-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-023-02228-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T13:02:43Z","timestamp":1701954163000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-023-02228-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,22]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["2228"],"URL":"https:\/\/doi.org\/10.1007\/s40314-023-02228-7","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,22]]},"assertion":[{"value":"30 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 January 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"91"}}