{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T18:54:36Z","timestamp":1768676076044,"version":"3.49.0"},"reference-count":27,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2019,9]]},"abstract":"<jats:p> Let G be a graph with an even number of vertices. The matching preclusion number of G is the minimum number of edges whose deletion leaves the resulting graph without a perfect matching, and the conditional matching preclusion number of G is the minimum number of edges whose deletion results in a graph with no isolated vertices and without a perfect matching. Matching preclusion number was introduced for measuring the robustness of a network when there is a link failure. In this paper, we focus on conditional matching preclusion for folded hypercube FQ<jats:sub>n<\/jats:sub>, an important variant of hypercube. We show that conditional matching preclusion number of FQ<jats:sub>n<\/jats:sub> is 2n and all optimal conditional matching preclusion sets are trivial for n \u2a7e 5. <\/jats:p>","DOI":"10.1142\/s0219265919400115","type":"journal-article","created":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T06:41:57Z","timestamp":1568097717000},"page":"1940011","source":"Crossref","is-referenced-by-count":4,"title":["Conditional Matching Preclusion for Folded Hypercubes"],"prefix":"10.1142","volume":"19","author":[{"given":"RUIZHI","family":"LIN","sequence":"first","affiliation":[{"name":"School of Mathematics and Physics, Fujian University of Technology, Fuzhou, Fujian, 350118, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HEPING","family":"ZHANG","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics, Lanzhou University, Lanzhou, Gansu, 730000, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"key":"p_1","first-page":"185","volume":"174","author":"Brigham R. C.","year":"2005","journal-title":"Congr. Numer."},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.046"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1002\/net.20440"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265910002726"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.10.029"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.03.040"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.03.014"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1109\/71.80187"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.05.024"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1002\/net.20204"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.01.010"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.05.002"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.11.028"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.04.003"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.02.001"},{"key":"p_19","first-page":"191","volume":"190","author":"Li Q.","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.07.039"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1080\/23799927.2016.1249412"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.09.020"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265907001941"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2005.04.002"},{"key":"p_25","first-page":"7","volume":"35","author":"Xu J.-M.","year":"2006","journal-title":"Australasian J. Combinatorics"},{"key":"p_26","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.08.017"},{"key":"p_27","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.06.050"},{"key":"p_28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.01.005"},{"key":"p_29","doi-asserted-by":"publisher","DOI":"10.1080\/00207160500113173"},{"key":"p_30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.11.003"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265919400115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T06:41:59Z","timestamp":1568097719000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265919400115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":27,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2019,9,9]]},"published-print":{"date-parts":[[2019,9]]}},"alternative-id":["10.1142\/S0219265919400115"],"URL":"https:\/\/doi.org\/10.1142\/s0219265919400115","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}