{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T16:25:41Z","timestamp":1776270341562,"version":"3.50.1"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"01n02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2010,3]]},"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. For many interconnection networks, the optimal sets are precisely those incident to a single vertex. Recently, the conditional matching preclusion number of a graph was introduced to look for obstruction sets beyond those incident to a single vertex. It is defined to be the minimum number of edges whose deletion results in a graph with no isolated vertices that has neither perfect matchings nor almost-perfect matchings. In this paper, we find this number and classify all optimal sets for the augmented cubes, a class of networks designed as an improvement of the hypercubes. <\/jats:p>","DOI":"10.1142\/s0219265910002726","type":"journal-article","created":{"date-parts":[[2010,11,11]],"date-time":"2010-11-11T10:20:58Z","timestamp":1289470858000},"page":"35-60","source":"Crossref","is-referenced-by-count":30,"title":["MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR AUGMENTED CUBES"],"prefix":"10.1142","volume":"11","author":[{"given":"EDDIE","family":"CHENG","sequence":"first","affiliation":[{"name":"Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RANDY","family":"JIA","sequence":"additional","affiliation":[{"name":"Detroit Country Day School, 22305 West 13 Mile Road, Beverly Hills, MI 48025-4435, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVID","family":"LU","sequence":"additional","affiliation":[{"name":"Detroit Country Day School, 22305 West 13 Mile Road, Beverly Hills, MI 48025-4435, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","first-page":"185","volume":"174","author":"Brigham R. C.","journal-title":"Congressus Numerantium"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054108006364"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.10.029"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1002\/net.20187"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1002\/net.10033"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1080\/00207160701543384"},{"key":"rf8","first-page":"2586","volume":"180","author":"Hsieh S.-Y.","journal-title":"Information Sciences"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.02.089"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2004.10.002"},{"key":"rf11","first-page":"1762","volume":"5","author":"Lee C.-M.","journal-title":"Computers and Mathematics with Applications"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2006.11.008"},{"key":"rf13","first-page":"60","volume":"35","author":"Park J.-H.","journal-title":"Journal of KIISE"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.02.041"},{"key":"rf15","first-page":"310","volume":"22","author":"Plesn\u00edk J.","journal-title":"Matematick\u00fd \u010casopis"},{"key":"rf16","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"1996"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.09.013"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265910002726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:33:05Z","timestamp":1565148785000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265910002726"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3]]},"references-count":16,"journal-issue":{"issue":"01n02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2010,3]]}},"alternative-id":["10.1142\/S0219265910002726"],"URL":"https:\/\/doi.org\/10.1142\/s0219265910002726","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3]]}}}