{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:57:15Z","timestamp":1758819435403},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1016\/j.dam.2023.05.021","type":"journal-article","created":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T11:28:58Z","timestamp":1686655738000},"page":"100-112","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/http\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Fractional matching preclusion numbers of Cartesian product graphs"],"prefix":"10.1016","volume":"338","author":[{"given":"Yu","family":"Luan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mei","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2023.05.021_b1","first-page":"185","article-title":"Perfect-matching preclusion","volume":"174","author":"Brigham","year":"2005","journal-title":"Congr. Numer."},{"key":"10.1016\/j.dam.2023.05.021_b2","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.tcs.2015.01.046","article-title":"Matching preclusion and conditional matching preclusion problems for the folded Petersen cube","volume":"576","author":"Cheng","year":"2015","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2023.05.021_b3","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1002\/net.20440","article-title":"Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions","volume":"59","author":"Cheng","year":"2012","journal-title":"Networks"},{"key":"10.1016\/j.dam.2023.05.021_b4","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.20441","article-title":"Matching preclusion and conditional matching preclusion problems for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyperstars","volume":"59","author":"Cheng","year":"2012","journal-title":"Networks"},{"key":"10.1016\/j.dam.2023.05.021_b5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1080\/17445760.2013.847441","article-title":"Matching preclusion and conditional matching preclusion for pancake and burnt pancake graphs","volume":"29","author":"Cheng","year":"2014","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"key":"10.1016\/j.dam.2023.05.021_b6","doi-asserted-by":"crossref","first-page":"1936","DOI":"10.1016\/j.dam.2012.03.040","article-title":"Matching preclusion and conditional matching preclusion for regular interconnection networks","volume":"160","author":"Cheng","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2023.05.021_b7","doi-asserted-by":"crossref","first-page":"1699","DOI":"10.1016\/j.dam.2012.03.014","article-title":"Matching preclusion and conditional matching preclusion problems for tori and related Cartersian products","volume":"160","author":"Cheng","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2023.05.021_b8","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.dam.2016.02.001","article-title":"Matching preclusion for vertex-transitive networks","volume":"207","author":"Li","year":"2016","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2023.05.021_b9","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.dam.2015.04.001","article-title":"Matching preclusion for cube-connected cycles","volume":"190\/191","author":"Li","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2023.05.021_b10","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1080\/23799927.2016.1249412","article-title":"Maximally matched and super matched regular graphs","volume":"1","author":"Lin","year":"2016","journal-title":"Int. J. Comput. Math. Comput. Syst. Theory"},{"key":"10.1016\/j.dam.2023.05.021_b11","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.dam.2017.07.039","article-title":"Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs","volume":"233","author":"Lin","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2023.05.021_b12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.dam.2019.08.016","article-title":"Matching preclusion for direct product of regular graphs","volume":"277","author":"Lin","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2023.05.021_b13","first-page":"109","article-title":"Matching preclusion for balanced hypercubes","volume":"84","author":"Lv","year":"2012","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.dam.2023.05.021_b14","doi-asserted-by":"crossref","DOI":"10.1142\/S0219265919400061","article-title":"A concise survey of matching preclusion in interconnection networks","volume":"19","author":"Mao","year":"2019","journal-title":"J. Interconnect. Netw."},{"key":"10.1016\/j.dam.2023.05.021_b15","series-title":"Fractioal Graph Theory","author":"Scheinerman","year":"1997"},{"key":"10.1016\/j.dam.2023.05.021_b16","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tcs.2020.09.021","article-title":"Fractional matching preclusion of product networks","volume":"846","author":"Wang","year":"2020","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2023.05.021_b17","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.tcs.2018.06.050","article-title":"Matching preclusion number in product graphs","volume":"755","author":"Wang","year":"2019","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2023.05.021_b18","doi-asserted-by":"crossref","first-page":"2066","DOI":"10.1016\/j.dam.2010.08.017","article-title":"Matching preclusion for k-ary n-cubes","volume":"158","author":"Wang","year":"2010","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X23001907?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X23001907?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T03:07:08Z","timestamp":1711595228000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X23001907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":18,"alternative-id":["S0166218X23001907"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2023.05.021","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2023,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fractional matching preclusion numbers of Cartesian product graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2023.05.021","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}