{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:32:27Z","timestamp":1740133947037,"version":"3.37.3"},"reference-count":26,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12101528"],"award-info":[{"award-number":["12101528"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Project of Xinjiang Uygur Autonomous Region","award":["2020D01C069"],"award-info":[{"award-number":["2020D01C069"]}]},{"name":"Tianchi Ph.D Program","award":["tcbs201905"],"award-info":[{"award-number":["tcbs201905"]}]},{"name":"National University Student Innovation Program Project","award":["202210755080"],"award-info":[{"award-number":["202210755080"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:p> The fault tolerance of an interconnection network of parallel and distributed systems can be evaluated by various topological parameters of its underlying graph [Formula: see text], with strong Menger edge connectivity being a vital parameter in this regard. A connected graph [Formula: see text] is called strongly Menger edge connected (SM-[Formula: see text]) if it connects any pair of vertices [Formula: see text] and [Formula: see text] with [Formula: see text] number of edge-disjoint paths. Under the uniform distribution of faults in a large interconnection network, it is improbable that each faulty edge incident to a vertex will occur simultaneously. Thus, [Formula: see text]-strongly Menger edge connected of order [Formula: see text] was introduced in 2018 by He et\u00a0al. Here, [Formula: see text] is called as [Formula: see text]-strongly Menger edge connected of order [Formula: see text], if [Formula: see text] remains SM-[Formula: see text], where [Formula: see text] is an arbitrary edge set in a graph [Formula: see text] with [Formula: see text] and the minimum degree of the remaining graph [Formula: see text]. The largest [Formula: see text] keeping the property of [Formula: see text] being SM-[Formula: see text] is denoted as [Formula: see text]. Among variants of hypercube, the [Formula: see text]-dimensional folded-crossed hypercube [Formula: see text] attracts attention in recent years. In this paper, we focus on calculating the exact value of the maximum conditional edge-fault-tolerant number of order [Formula: see text] of [Formula: see text], [Formula: see text] for two integers [Formula: see text] and [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054124500035","type":"journal-article","created":{"date-parts":[[2024,3,20]],"date-time":"2024-03-20T04:37:39Z","timestamp":1710909459000},"page":"1007-1019","source":"Crossref","is-referenced-by-count":0,"title":["A Note of Reliability Analysis of <i>SM<\/i>-\u03bb in Folded-Crossed Hypercube with Conditional Faults"],"prefix":"10.1142","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-9480-2833","authenticated-orcid":false,"given":"Jinjie","family":"Ma","sequence":"first","affiliation":[{"name":"Department of College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2621-9022","authenticated-orcid":false,"given":"Mingzu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3377-5425","authenticated-orcid":false,"given":"Chenxi","family":"Li","sequence":"additional","affiliation":[{"name":"Department of College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6747-7316","authenticated-orcid":false,"given":"Hengji","family":"Qiao","sequence":"additional","affiliation":[{"name":"Department of College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, P. R. China"},{"name":"Department of College of Mathematics, Jilin University, Changchun 130012, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6476-4566","authenticated-orcid":false,"given":"Yang","family":"Fan","sequence":"additional","affiliation":[{"name":"Department of College of Software, Xinjiang University, Urumqi Xinjiang 830008, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2024,3,19]]},"reference":[{"key":"S0129054124500035BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.10.006"},{"key":"S0129054124500035BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.10.013"},{"key":"S0129054124500035BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.03.022"},{"key":"S0129054124500035BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.03.011"},{"key":"S0129054124500035BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2021.03.006"},{"key":"S0129054124500035BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/71.80187"},{"key":"S0129054124500035BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/71.159036"},{"key":"S0129054124500035BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.09.047"},{"key":"S0129054124500035BIB009","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxaa037"},{"key":"S0129054124500035BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.04.001"},{"key":"S0129054124500035BIB011","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"S0129054124500035BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00012-4"},{"key":"S0129054124500035BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2013.04.009"},{"key":"S0129054124500035BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.10.017"},{"key":"S0129054124500035BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.12.024"},{"key":"S0129054124500035BIB016","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265921420159"},{"key":"S0129054124500035BIB018","doi-asserted-by":"publisher","DOI":"10.5120\/807-1147"},{"key":"S0129054124500035BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00600-5"},{"key":"S0129054124500035BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2016.09.002"},{"key":"S0129054124500035BIB021","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626423500032"},{"key":"S0129054124500035BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.128"},{"key":"S0129054124500035BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/S1383-7621(02)00051-6"},{"key":"S0129054124500035BIB024","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-008-0239-4"},{"key":"S0129054124500035BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.03.125"},{"key":"S0129054124500035BIB026","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626420400010"},{"key":"S0129054124500035BIB027","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-021-04185-6"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054124500035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T04:22:32Z","timestamp":1734582152000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054124500035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,19]]},"references-count":26,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10.1142\/S0129054124500035"],"URL":"https:\/\/doi.org\/10.1142\/s0129054124500035","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2024,3,19]]}}}