{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:25:01Z","timestamp":1763727901640,"version":"3.40.5"},"reference-count":22,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["11601254","11551001"],"award-info":[{"award-number":["11601254","11551001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"The Science Found. of Qinghai Province","award":["2016-ZJ-948Q","2017-ZJ-949Q","2019-ZJ-921"],"award-info":[{"award-number":["2016-ZJ-948Q","2017-ZJ-949Q","2019-ZJ-921"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2021,3]]},"abstract":"<jats:p> Let [Formula: see text] be a set edges and [Formula: see text] be a set of edges and\/or vertices of a graph [Formula: see text], then [Formula: see text] (resp.\u00a0[Formula: see text]) is a fractional matching preclusion set (resp.\u00a0fractional strong matching preclusion set) if [Formula: see text] (resp.\u00a0[Formula: see text]) contains no fractional perfect matching. The fractional matching preclusion number (resp.\u00a0fractional strong matching preclusion number) of [Formula: see text] is the minimum size of fractional matching preclusion set (resp.\u00a0fractional strong matching preclusion set) of [Formula: see text]. In this paper, we obtain the fractional matching preclusion number and fractional strong matching preclusion number of the DHcube [Formula: see text] for [Formula: see text]. In addition, all the optimal fractional matching preclusion sets and fractional strong matching preclusion sets of these graphs are categorized. <\/jats:p>","DOI":"10.1142\/s0129626421500018","type":"journal-article","created":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T06:59:15Z","timestamp":1614149955000},"page":"2150001","source":"Crossref","is-referenced-by-count":1,"title":["Fractional Strong Matching Preclusion for DHcube"],"prefix":"10.1142","volume":"31","author":[{"given":"He","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai 810008, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8551-3339","authenticated-orcid":false,"given":"Jinyu","family":"Zou","sequence":"additional","affiliation":[{"name":"School of Computer Sciences, Qinghai Normal University, Xining, Qinghai, 810008, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuangshuang","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai 810008, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengfu","family":"Ye","sequence":"additional","affiliation":[{"name":"School of Computer Sciences, Qinghai Normal University, Xining, Qinghai, 810008, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,2,24]]},"reference":[{"key":"S0129626421500018BIB001","first-page":"185","volume":"174","author":"Birgham R. C.","year":"2005","journal-title":"Congressus Numerantium"},{"key":"S0129626421500018BIB002","doi-asserted-by":"publisher","DOI":"10.1002\/net.20187"},{"key":"S0129626421500018BIB003","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054108006364"},{"key":"S0129626421500018BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.10.029"},{"key":"S0129626421500018BIB005","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626418500172"},{"key":"S0129626421500018BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.09.020"},{"key":"S0129626421500018BIB007","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230414"},{"key":"S0129626421500018BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.08.008"},{"key":"S0129626421500018BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0077-x"},{"volume-title":"International Symposium on Pervasive Systems, Algorithms and Networks","author":"Ma T.","key":"S0129626421500018BIB010"},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey M. R.","key":"S0129626421500018BIB011"},{"key":"S0129626421500018BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90033-8"},{"key":"S0129626421500018BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.06.001"},{"first-page":"800","volume-title":"Proc. of the 5th IEEE Symposium on Parallel and Distributed Processing (SPDP)","author":"Vaidya A. S.","key":"S0129626421500018BIB014"},{"key":"S0129626421500018BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2019.07.014"},{"key":"S0129626421500018BIB016","doi-asserted-by":"publisher","DOI":"10.1109\/71.159036"},{"key":"S0129626421500018BIB017","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-17943-7_126"},{"key":"S0129626421500018BIB018","doi-asserted-by":"publisher","DOI":"10.1109\/12.102840"},{"key":"S0129626421500018BIB019","doi-asserted-by":"publisher","DOI":"10.1109\/12.381950"},{"first-page":"11","volume-title":"Proc. of the 9th IEEE International Parallel Processing Symposium (IPPS)","author":"Singhvi N. K.","key":"S0129626421500018BIB020"},{"key":"S0129626421500018BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.06.010"},{"key":"S0129626421500018BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.12.043"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626421500018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,24]],"date-time":"2021-02-24T07:00:05Z","timestamp":1614150005000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626421500018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,24]]},"references-count":22,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["10.1142\/S0129626421500018"],"URL":"https:\/\/doi.org\/10.1142\/s0129626421500018","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"type":"print","value":"0129-6264"},{"type":"electronic","value":"1793-642X"}],"subject":[],"published":{"date-parts":[[2021,2,24]]}}}