{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:29:14Z","timestamp":1747189754286,"version":"3.40.5"},"reference-count":28,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61170303"],"award-info":[{"award-number":["61170303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472465"],"award-info":[{"award-number":["61472465"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61562066"],"award-info":[{"award-number":["61562066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the National Key R&D Program of China","award":["2018YFC0910500"],"award-info":[{"award-number":["2018YFC0910500"]}]},{"DOI":"10.13039\/501100005047","name":"Natural Science Foundation of Liaoning Province","doi-asserted-by":"publisher","award":["20170540302"],"award-info":[{"award-number":["20170540302"]}],"id":[{"id":"10.13039\/501100005047","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2021,4]]},"abstract":"<jats:p> As one of the most fundamental networks for parallel and distributed computation, cycle is suitable for developing simple algorithms with low communication cost. A graph [Formula: see text] is called [Formula: see text]-fault-tolerant edge-pancyclic if after deleting any faulty set [Formula: see text] of [Formula: see text] vertices and\/or edges from [Formula: see text], every correct edge in the resulting graph lies in a cycle of every length from [Formula: see text] to [Formula: see text], inclusively, where [Formula: see text] is the girth of [Formula: see text], the length of a shortest cycle in [Formula: see text]. The [Formula: see text]-dimensional crossed cube [Formula: see text] is an important variant of the hypercube [Formula: see text], which possesses some properties superior to the hypercube. This paper investigates the fault-tolerant edge-pancyclicity of [Formula: see text], and shows that if [Formula: see text] contains at most [Formula: see text] faulty vertices and\/or edges then, for any fault-free edge [Formula: see text] and every length [Formula: see text] from [Formula: see text] to [Formula: see text] except [Formula: see text], there is a fault-free cycle of length [Formula: see text] containing the edge [Formula: see text]. The result is optimal in some senses. <\/jats:p>","DOI":"10.1142\/s0129054121500167","type":"journal-article","created":{"date-parts":[[2021,1,26]],"date-time":"2021-01-26T15:20:09Z","timestamp":1611674409000},"page":"289-304","source":"Crossref","is-referenced-by-count":1,"title":["(n \u2212 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn"],"prefix":"10.1142","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7558-3031","authenticated-orcid":false,"given":"Xirong","family":"Xu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huifeng","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziming","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3776-9799","authenticated-orcid":false,"given":"Qiang","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Dalian University of Technology, Dalian 116024, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Zhongshan College of Dalian Medical University, Dalian 116085, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,1,25]]},"reference":[{"volume-title":"Hypercubes and Distributed Computers","year":"1989","author":"Andre F.","key":"S0129054121500167BIB001"},{"volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","year":"1992","author":"Leighton F. T.","key":"S0129054121500167BIB002"},{"volume-title":"Parallel Computation: Models and Methods","year":"1997","author":"Akl S. G.","key":"S0129054121500167BIB003"},{"key":"S0129054121500167BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-009-0017-5"},{"key":"S0129054121500167BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-77179-8"},{"key":"S0129054121500167BIB006","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364"},{"key":"S0129054121500167BIB007","first-page":"105","volume-title":"Proceeding of the Annual Symposium on Computer Architecture","author":"Sullivan H.","year":"1977"},{"key":"S0129054121500167BIB008","doi-asserted-by":"publisher","DOI":"10.1145\/2465.2467"},{"key":"S0129054121500167BIB009","first-page":"51","volume-title":"Proceeding of Conference on Hypercube Concurrent Computers and Applications","author":"Nugent S. F.","year":"1988"},{"volume-title":"The Connection Machine","year":"1985","author":"Hillis W. D.","key":"S0129054121500167BIB010"},{"volume-title":"Introduction to Parallel Processing: Algorithms and Architectures","year":"1999","author":"Parhami B.","key":"S0129054121500167BIB011"},{"key":"S0129054121500167BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/12.102840"},{"key":"S0129054121500167BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.09.026"},{"key":"S0129054121500167BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.10.008"},{"key":"S0129054121500167BIB015","first-page":"329","volume":"35","author":"Ma M. J.","year":"2005","journal-title":"Journal of University of Science and Technology of China"},{"key":"S0129054121500167BIB016","first-page":"107","volume":"13","author":"Yang X. F.","year":"2005","journal-title":"Neural, Parallel and Scientific Computations"},{"key":"S0129054121500167BIB017","first-page":"1359","volume":"85","author":"Huang W. T.","year":"2002","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"S0129054121500167BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(02)00933-5"},{"key":"S0129054121500167BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2003.08.007"},{"key":"S0129054121500167BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.01.001"},{"key":"S0129054121500167BIB021","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.151"},{"key":"S0129054121500167BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.09.015"},{"key":"S0129054121500167BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.05.002"},{"key":"S0129054121500167BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00167-W"},{"key":"S0129054121500167BIB025","doi-asserted-by":"publisher","DOI":"10.1109\/CIS.2011.57"},{"key":"S0129054121500167BIB026","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9024-7"},{"key":"S0129054121500167BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.04.004"},{"key":"S0129054121500167BIB028","doi-asserted-by":"publisher","DOI":"10.3390\/math7111066"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054121500167","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,13]],"date-time":"2021-04-13T11:14:20Z","timestamp":1618312460000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054121500167"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,25]]},"references-count":28,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["10.1142\/S0129054121500167"],"URL":"https:\/\/doi.org\/10.1142\/s0129054121500167","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2021,1,25]]}}}