{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T09:10:50Z","timestamp":1778490650538,"version":"3.51.4"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202409100010"],"award-info":[{"award-number":["202409100010"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Fujian Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2023J01539"],"award-info":[{"award-number":["2023J01539"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.dam.2026.03.054","type":"journal-article","created":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T04:48:48Z","timestamp":1775537328000},"page":"126-134","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Enumeration of spanning trees containing a perfect matching in saturated non-covered graphs"],"prefix":"10.1016","volume":"389","author":[{"given":"Yan","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengming","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7269-115X","authenticated-orcid":false,"given":"Tao","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.03.054_b1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/j.dam.2020.03.061","article-title":"Spanning 2-forests and resistance distance in 2-connected graphs","volume":"284","author":"Barrett","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.054_b2","first-page":"623","article-title":"On the energy of blossomed stars","volume":"83","author":"Chen","year":"2020","journal-title":"Match Commun. Math. Comput. Chem."},{"key":"10.1016\/j.dam.2026.03.054_b3","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1007\/s10801-022-01131-4","article-title":"Counting spanning trees in almost complete multipartite graphs","volume":"56","author":"Cheng","year":"2022","journal-title":"J. Algebraic Combin."},{"key":"10.1016\/j.dam.2026.03.054_b4","series-title":"The Combinatorics of Network Reliability","author":"Colbourn","year":"1987"},{"key":"10.1016\/j.dam.2026.03.054_b5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.laa.2016.12.007","article-title":"Core-satellite graphs: Clustering, assortativity and spectral properties","volume":"517","author":"Estrada","year":"2017","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.054_b6","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1016\/j.dam.2020.02.002","article-title":"Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs","volume":"283","author":"Ge","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.054_b7","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.dam.2026.03.054_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2024.128882","article-title":"Enumeration of spanning trees containing a perfect matching in linear polygonal chains","volume":"479","author":"Lai","year":"2024","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2026.03.054_b9","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1002\/jgt.22954","article-title":"Enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest","volume":"104","author":"Li","year":"2023","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.03.054_b10","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.dam.2024.07.026","article-title":"Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and M\u00f6bius strip","volume":"358","author":"Li","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.054_b11","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2023.128125","article-title":"Counting spanning trees with a Kekul\u00e9 structure in linear hexagonal chains","volume":"456","author":"Li","year":"2023","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2026.03.054_b12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1002\/jgt.23220","article-title":"A variant of the Teufl-Wagner formula and applications","volume":"109","author":"Li","year":"2025","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.03.054_b13","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2024.128722","article-title":"Enumeration of spanning trees containing perfect matchings in hexagonal chains with a unique kink","volume":"475","author":"Ma","year":"2024","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.dam.2026.03.054_b14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1214\/ECP.v5-1016","article-title":"Loop-erased random walks, spanning trees and Hamiltonian cycles","volume":"5","author":"Marchal","year":"2000","journal-title":"Electron. Commun. Probab."},{"key":"10.1016\/j.dam.2026.03.054_b15","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.dam.2024.11.011","article-title":"Resistance distance in generalized core-satellite graphs","volume":"362","author":"Ni","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.054_b16","series-title":"The Nature of Chemical Bond","author":"Pauling","year":"1939"},{"key":"10.1016\/j.dam.2026.03.054_b17","first-page":"255","article-title":"Enumeration of matchings: problems and progress","volume":"38","author":"Propp","year":"1999","journal-title":"New Perspect. Geom. Comb."},{"key":"10.1016\/j.dam.2026.03.054_b18","series-title":"Linear Graphs and Electrical Networks","author":"Seshu","year":"1961"},{"key":"10.1016\/j.dam.2026.03.054_b19","first-page":"147","article-title":"Trees with 1-factors: degree distribution","volume":"45","author":"Simion","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/j.dam.2026.03.054_b20","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(91)90061-6","article-title":"Trees with 1-factors and oriented trees","volume":"88","author":"Simion","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.054_b21","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.dam.2026.03.054_b22","doi-asserted-by":"crossref","first-page":"065106(R)","DOI":"10.1103\/PhysRevE.73.065106","article-title":"Synchronization is optimal in nondiagonalizable networks","volume":"73","author":"Takashi","year":"2006","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.dam.2026.03.054_b23","series-title":"Enumeration of spanning trees containing a given spanning forest in generalized core-satellite graphs","author":"Tang","year":"2026"},{"key":"10.1016\/j.dam.2026.03.054_b24","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/j.laa.2009.08.028","article-title":"Determinant identities for Laplace matrices","volume":"432","author":"Teufl","year":"2010","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.dam.2026.03.054_b25","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1007\/s10955-011-0140-z","article-title":"Resistance scaling and the number of spanning trees in self-similar lattices","volume":"142","author":"Teufl","year":"2011","journal-title":"J. Stat. Phys."},{"key":"10.1016\/j.dam.2026.03.054_b26","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1007\/s00373-014-1463-8","article-title":"On graphs with a unique perfect matching","volume":"31","author":"Wang","year":"2015","journal-title":"Graph Comb."},{"key":"10.1016\/j.dam.2026.03.054_b27","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1088\/0305-4470\/10\/6\/004","article-title":"Number of spanning trees on a lattice","volume":"10","author":"Wu","year":"1977","journal-title":"J. Phys. A: Math. Gen."},{"key":"10.1016\/j.dam.2026.03.054_b28","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.dam.2025.07.029","article-title":"The size and the spectral radius of a saturated non-covered graph","volume":"377","author":"Wu","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.054_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114300","article-title":"Counting spanning trees of multiple complete split-like graph containing a given spanning forest","volume":"348","author":"Yang","year":"2025","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.03.054_b30","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.dam.2025.11.001","article-title":"Resistance distance and spanning trees of generalized multiple complete split-like graph","volume":"381","author":"Yang","year":"2026","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.054_b31","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10801-020-00969-w","article-title":"The enumeration of spanning tree of weighted graphs","volume":"54","author":"Zhou","year":"2021","journal-title":"J. Algebr. Comb."},{"key":"10.1016\/j.dam.2026.03.054_b32","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.dam.2024.12.013","article-title":"On saturated non-covered graphs","volume":"364","author":"Zhou","year":"2025","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.03.054_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2025.129772","article-title":"Counting matchable spanning trees of join graphs","volume":"512","author":"Zhou","year":"2026","journal-title":"Appl. Math. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T08:37:17Z","timestamp":1778488637000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":33,"alternative-id":["S0166218X26002015"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.054","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Enumeration of spanning trees containing a perfect matching in saturated non-covered graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.03.054","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}