{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T20:07:12Z","timestamp":1784059632642,"version":"3.55.0"},"reference-count":8,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005270","name":"Fujian Provincial Department of Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005270","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":[[2027,1]]},"DOI":"10.1016\/j.amc.2026.130237","type":"journal-article","created":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T13:24:59Z","timestamp":1783949099000},"page":"130237","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Generalized Tur\u00e1n number of matchings for connected graphs"],"prefix":"10.1016","volume":"532","author":[{"given":"Jinling","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianlong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2026.130237_bib0001","first-page":"436","article-title":"On an extremal problem in graph theory","volume":"48","author":"Tur\u00e1n","year":"1941","journal-title":"Math. Fiz. Lapok"},{"key":"10.1016\/j.amc.2026.130237_bib0002","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta. Math. Hungar."},{"key":"10.1016\/j.amc.2026.130237_bib0003","article-title":"A note on maximum size of a graph without isolated vertices under the given matching number","volume":"460","author":"Shi","year":"2024","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.amc.2026.130237_bib0004","first-page":"163","article-title":"On some properties of linear complexes","volume":"66","author":"Zykov","year":"1949","journal-title":"Mat. Sb."},{"key":"10.1016\/j.amc.2026.130237_bib0005","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.jctb.2017.08.005","article-title":"The maximum number of cliques in graphs without long cycles","volume":"128","author":"Luo","year":"2017","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.amc.2026.130237_bib0006","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2019.103057","article-title":"The shifting method and generalized Tur\u00e1n number of matchings","volume":"85","author":"Wang","year":"2020","journal-title":"European J. Combin."},{"key":"10.1016\/j.amc.2026.130237_bib0007","first-page":"258","article-title":"Sur le couplage maximum d\u2019un graphe","volume":"247","author":"Berge","year":"1958","journal-title":"C. R. Acad. Sci"},{"key":"10.1016\/j.amc.2026.130237_bib0008","doi-asserted-by":"crossref","first-page":"P3","DOI":"10.37236\/11022","article-title":"Maximum size of a graph with given fractional matching number","volume":"29","author":"Ma","year":"2022","journal-title":"Electron J. Combin."}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326002894?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0096300326002894?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T19:18:27Z","timestamp":1784056707000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0096300326002894"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2027,1]]},"references-count":8,"alternative-id":["S0096300326002894"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2026.130237","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2027,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalized Tur\u00e1n number of matchings for connected graphs","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2026.130237","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":"130237"}}