{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:05:47Z","timestamp":1777705547719,"version":"3.51.4"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371355"],"award-info":[{"award-number":["12371355"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.amc.2026.130062","type":"journal-article","created":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T09:45:58Z","timestamp":1774777558000},"page":"130062","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Enumerating perfect matchings in line graphs of graphs with pendent edges"],"prefix":"10.1016","volume":"526","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7722-0794","authenticated-orcid":false,"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":"78","reference":[{"key":"10.1016\/j.amc.2026.130062_bib0001","article-title":"Graph Theory, Graduate Texts in Mathematics","author":"Bondy","year":"2008"},{"key":"10.1016\/j.amc.2026.130062_bib0002","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01010403","article-title":"Two-dimensional monomer-dimer systems are computationally intractable","volume":"48","author":"Jerrum","year":"1987","journal-title":"J. Stat. Phys."},{"key":"10.1016\/j.amc.2026.130062_bib0003","article-title":"Matching theory","volume":"29","author":"Lov\u00e1sz","year":"1986","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.amc.2026.130062_bib0004","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.amc.2026.130062_bib0005","series-title":"New Perspectives in Geometric Combinatorics, Math. Sci. Res. Inst. Publ.","article-title":"Enumerations of Matchings: Problems and Progress","volume":"38","author":"Propp","year":"1999"},{"key":"10.1016\/j.amc.2026.130062_bib0006","first-page":"233","article-title":"A graphic model of a class of molecules","volume":"4","author":"Hall","year":"1973","journal-title":"Int. J. Math. Educ. Sci."},{"key":"10.1016\/j.amc.2026.130062_bib0007","article-title":"The Nature of Chemical Bond","author":"Pauling","year":"1939"},{"key":"10.1016\/j.amc.2026.130062_bib0008","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/S0040-4039(00)71975-7","article-title":"Kekul\u00e9 structures and resonance energies of benzennoid hydrocarbons","volume":"16","author":"Swinborne-Sheldrake","year":"1975","journal-title":"Tetrahedron Lett."},{"key":"10.1016\/j.amc.2026.130062_bib0009","first-page":"444","article-title":"Characterization of molecular branching","volume":"99","author":"Randi\u0107","year":"1976","journal-title":"J. Amer. Chem. Soc."},{"key":"10.1016\/j.amc.2026.130062_bib0010","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1063\/1.1703953","article-title":"Dimer statistics and phase transitions","volume":"4","author":"Kasteleyn","year":"1963","journal-title":"J. Math. Phys."},{"key":"10.1016\/j.amc.2026.130062_bib0011","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1090\/S0002-9939-1974-0323648-6","article-title":"Graphs with 1-factors","volume":"42","author":"Sumner","year":"1974","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/j.amc.2026.130062_bib0012","first-page":"257","article-title":"A note on matchings in graphs","volume":"17","author":"Vergnas","year":"1975","journal-title":"Colloq. Th\u00e9or. Graphes, Cah. Cent. \u00c9tud. Rech. Op\u00e9r"},{"key":"10.1016\/j.amc.2026.130062_bib0013","doi-asserted-by":"crossref","first-page":"291","DOI":"10.2206\/kyushujm.66.291","article-title":"Perfect matchings of Fisher graphs of cubic graphs","volume":"66","author":"Ciucu","year":"2012","journal-title":"Kyushu J. Math."},{"key":"10.1016\/j.amc.2026.130062_bib0014","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1016\/j.dam.2012.10.032","article-title":"On the number of perfect matchings of line graphs","volume":"161","author":"Dong","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130062_bib0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113427","article-title":"On the dimer problem of the vertex-edge graph of a cubic graph","volume":"346","author":"Li","year":"2023","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130062_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113847","article-title":"Enumeration of perfect matchings of the middle graph of a graph G with \u0394(G)\u202f\u2264\u202f4","volume":"347","author":"Lai","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.amc.2026.130062_bib0017","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.dam.2025.01.021","article-title":"On the number of perfect matchings of middle graphs","volume":"366","author":"Lai","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.amc.2026.130062_bib0018","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1080\/10406638.2021.2021428","article-title":"On the number of matchings of two classes of silicate molecular graphs","volume":"43","author":"Li","year":"2023","journal-title":"Polycycl. Aromat. Compd."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326001141?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326001141?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:44:11Z","timestamp":1777455851000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300326001141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":18,"alternative-id":["S0096300326001141"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2026.130062","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Enumerating perfect matchings in line graphs of graphs with pendent edges","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2026.130062","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"130062"}}