{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T23:41:27Z","timestamp":1773099687982,"version":"3.50.1"},"reference-count":12,"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> A multiprocessor system and interconnection network have a underlying topology, which is usually presented by a graph, where nodes represent processors and links represent communication links between processors. The (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves the resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matchings. In this paper, we prove that (1) the connectivity (edge connectivity) of the leaf-sort graph CF<jats:sub>n<\/jats:sub> is [Formula: see text] for odd n and [Formula: see text] for even n; (2) CF<jats:sub>n<\/jats:sub> is super edge-connected; (3) the matching preclusion number of CF<jats:sub>n<\/jats:sub> is [Formula: see text] for odd n and [Formula: see text] for even n; (4) the conditional matching preclusion number of CF<jats:sub>n<\/jats:sub> is 3n \u2013 5 for odd n and n \u2265 3, and 3n \u2013 6 for even n and n \u2265 4. <\/jats:p>","DOI":"10.1142\/s0219265919400073","type":"journal-article","created":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T06:41:57Z","timestamp":1568097717000},"page":"1940007","source":"Crossref","is-referenced-by-count":21,"title":["Connectivity and Matching Preclusion for Leaf-Sort Graphs"],"prefix":"10.1142","volume":"19","author":[{"given":"SHIYING","family":"WANG","sequence":"first","affiliation":[{"name":"School of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YANLING","family":"WANG","sequence":"additional","affiliation":[{"name":"School of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MUJIANGSHAN","family":"WANG","sequence":"additional","affiliation":[{"name":"School of Electrical Engineering and Computer Science, The University of Newcastle, NSW 2308, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"key":"p_2","first-page":"185","volume":"174","author":"Brigham R. C.","year":"2005","journal-title":"Congressus Numerantium"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1002\/net.20187"},{"key":"p_5","first-page":"369","volume":"120","author":"Cheng E.","year":"2015","journal-title":"Ars Combinatoria"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1080\/00207160902883514"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1109\/12.42131"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.06.002"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1109\/12.262126"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.02.001"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.12.035"},{"issue":"2","key":"p_13","first-page":"60","volume":"35","author":"Park J.-H.","year":"2008","journal-title":"Journal of KISS"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.02.041"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.08.017"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265919400073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T06:42:31Z","timestamp":1568097751000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265919400073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":12,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2019,9,9]]},"published-print":{"date-parts":[[2019,9]]}},"alternative-id":["10.1142\/S0219265919400073"],"URL":"https:\/\/doi.org\/10.1142\/s0219265919400073","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}