{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:16:59Z","timestamp":1763727419590,"version":"3.37.3"},"reference-count":19,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["11601254"],"award-info":[{"award-number":["11601254"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2018,12]]},"abstract":"<jats:p>The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu introduced the concept of fractional matching preclusion number in 2017. The Fractional Matching Preclusion Number (FMP number) of G is the minimum number of edges whose deletion leaves the resulting graph without a fractional perfect matching. The Fractional Strong Matching Preclusion Number (FSMP number) of G is the minimum number of vertices and\/or edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the FMP number and the FSMP number for (n, k)-star graphs. In addition, all the optimal fractional strong matching preclusion sets of these graphs are categorized.<\/jats:p>","DOI":"10.1142\/s0129626418500172","type":"journal-article","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T04:21:31Z","timestamp":1545279691000},"page":"1850017","source":"Crossref","is-referenced-by-count":7,"title":["Fractional Matching Preclusion for (<i>n<\/i>,<i>k<\/i>)-Star Graphs"],"prefix":"10.1142","volume":"28","author":[{"given":"Tianlong","family":"Ma","sequence":"first","affiliation":[{"name":"Department of Basic Research, Qinghai University, Xining, Qinghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaping","family":"Mao","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Qinghai Normal University, Xining, Qinghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eddie","family":"Cheng","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Statistics, Oakland University, Rochester, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinling","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2018,12,19]]},"reference":[{"key":"S0129626418500172BIB002","first-page":"185","volume":"174","author":"Brigham R. C.","year":"2005","journal-title":"Congressus Numerantium"},{"key":"S0129626418500172BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S0129626418500172BIB004","first-page":"91","volume":"224","author":"Chang W.","year":"2015","journal-title":"Congressus Numerantium"},{"key":"S0129626418500172BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.11.051"},{"key":"S0129626418500172BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626413500047"},{"key":"S0129626418500172BIB007","doi-asserted-by":"publisher","DOI":"10.1002\/net.20187"},{"key":"S0129626418500172BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.10.029"},{"key":"S0129626418500172BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.05.002"},{"key":"S0129626418500172BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00162-1"},{"key":"S0129626418500172BIB011","doi-asserted-by":"publisher","DOI":"10.1002\/net.10096"},{"key":"S0129626418500172BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.02.001"},{"key":"S0129626418500172BIB013","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.amc.2015.11.016","volume":"274","author":"Li S. S.","year":"2016","journal-title":"Appl. Math. Comput."},{"key":"S0129626418500172BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0077-x"},{"key":"S0129626418500172BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.12.035"},{"key":"S0129626418500172BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.08.008"},{"volume-title":"Fractional Graph Theory: A Rational Approach to the Theory of Graphs","year":"1997","author":"Scheinerman E. R.","key":"S0129626418500172BIB017"},{"key":"S0129626418500172BIB018","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-22.2.107"},{"key":"S0129626418500172BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.08.015"},{"key":"S0129626418500172BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.03.021"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626418500172","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:52:31Z","timestamp":1662670351000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626418500172"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12]]},"references-count":19,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2018,12,19]]},"published-print":{"date-parts":[[2018,12]]}},"alternative-id":["10.1142\/S0129626418500172"],"URL":"https:\/\/doi.org\/10.1142\/s0129626418500172","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"type":"print","value":"0129-6264"},{"type":"electronic","value":"1793-642X"}],"subject":[],"published":{"date-parts":[[2018,12]]}}}