{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:38:32Z","timestamp":1740155912370,"version":"3.37.3"},"reference-count":22,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2019,8]]},"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 recently introduced the concept of fractional matching preclusion number. The fractional matching preclusion number (FMP number) of [Formula: see text], denoted by [Formula: see text], 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 [Formula: see text], denoted by [Formula: see text], is the minimum number of vertices and edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we study the fractional matching preclusion number and the fractional strong matching preclusion number for the radix triangular mesh [Formula: see text], and all the optimal fractional matching preclusion sets and fractional strong matching preclusion sets of these graphs are categorized. <\/jats:p>","DOI":"10.1142\/s1793830919500484","type":"journal-article","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T22:41:21Z","timestamp":1564440081000},"page":"1950048","source":"Crossref","is-referenced-by-count":0,"title":["Fractional matching preclusion for radix triangular mesh"],"prefix":"10.1142","volume":"11","author":[{"given":"Xia","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, Qinghai Normal, University, Xining, Qinghai 810008, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9723-9055","authenticated-orcid":false,"given":"Tianlong","family":"Ma","sequence":"additional","affiliation":[{"name":"Department of Basic Research, Qinghai University, Xining, Qinghai 810016, P. R. China"}]},{"given":"Jun","family":"Yin","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Qinghai Normal, University, Xining, Qinghai 810008, P. R. China"}]},{"given":"Chengfu","family":"Ye","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Qinghai Normal, University, Xining, Qinghai 810008, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2019,9,16]]},"reference":[{"key":"S1793830919500484BIB001","first-page":"185","volume":"174","author":"Brigham R. C.","year":"2005","journal-title":"Congr. Numer."},{"key":"S1793830919500484BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S1793830919500484BIB003","first-page":"91","volume":"224","author":"Chang W.","year":"2015","journal-title":"Congr. Numer."},{"key":"S1793830919500484BIB004","first-page":"35","volume":"11","author":"Cheng E.","year":"2010","journal-title":"JOIN"},{"key":"S1793830919500484BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.11.051"},{"key":"S1793830919500484BIB006","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2014.1000323"},{"key":"S1793830919500484BIB007","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626413500047"},{"key":"S1793830919500484BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/net.20187"},{"key":"S1793830919500484BIB009","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054108006364"},{"key":"S1793830919500484BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.10.029"},{"key":"S1793830919500484BIB011","first-page":"61","volume":"210","author":"Cheng E.","year":"2010","journal-title":"Congr. Numer."},{"key":"S1793830919500484BIB012","doi-asserted-by":"publisher","DOI":"10.1080\/00207160902883514"},{"key":"S1793830919500484BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.05.002"},{"key":"S1793830919500484BIB014","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230414"},{"key":"S1793830919500484BIB015","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-016-0077-x"},{"key":"S1793830919500484BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.12.035"},{"key":"S1793830919500484BIB017","first-page":"60","volume":"35","author":"Park J. H.","year":"2008","journal-title":"J. KISS"},{"key":"S1793830919500484BIB018","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":"S1793830919500484BIB019"},{"key":"S1793830919500484BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00149-1"},{"volume-title":"Introduction to Graph Theory.","year":"1996","author":"West D. B.","key":"S1793830919500484BIB021"},{"issue":"1","key":"S1793830919500484BIB022","first-page":"28","volume":"1","author":"Xavier D. A.","year":"2015","journal-title":"J. Theor. Comput. Math."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830919500484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T22:00:16Z","timestamp":1568671216000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830919500484"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":22,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["10.1142\/S1793830919500484"],"URL":"https:\/\/doi.org\/10.1142\/s1793830919500484","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}