{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:32:14Z","timestamp":1740133934269,"version":"3.37.3"},"reference-count":42,"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":["11301217","61572010"],"award-info":[{"award-number":["11301217","61572010"]}],"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":["61572010"],"award-info":[{"award-number":["61572010"]}],"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":["11671296"],"award-info":[{"award-number":["11671296"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"crossref","award":["2018J01419"],"award-info":[{"award-number":["2018J01419"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2019,12]]},"abstract":"<jats:p> An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processors and communication links, respectively. Connectivity is an important metric for fault tolerance of interconnection networks. A graph [Formula: see text] is said to be maximally local-connected if each pair of vertices [Formula: see text] and [Formula: see text] are connected by [Formula: see text] vertex-disjoint paths. In this paper, we show that Cayley graphs generated by [Formula: see text]([Formula: see text]) transpositions are [Formula: see text]-fault-tolerant maximally local-connected and are also [Formula: see text]-fault-tolerant one-to-many maximally local-connected if their corresponding transposition generating graphs have a triangle, [Formula: see text]-fault-tolerant one-to-many maximally local-connected if their corresponding transposition generating graphs have no triangles. Furthermore, under the restricted condition that each vertex has at least two fault-free adjacent vertices, Cayley graphs generated by [Formula: see text]([Formula: see text]) transpositions are [Formula: see text]-fault-tolerant maximally local-connected if their corresponding transposition generating graphs have no triangles. <\/jats:p>","DOI":"10.1142\/s0129054119500278","type":"journal-article","created":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T02:01:30Z","timestamp":1576202490000},"page":"1301-1315","source":"Crossref","is-referenced-by-count":5,"title":["Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions"],"prefix":"10.1142","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2060-9289","authenticated-orcid":false,"given":"Liqiong","family":"Xu","sequence":"first","affiliation":[{"name":"School of Science, Jimei University, Xiamen, Fujian 361021, P. R. China"}]},{"given":"Shuming","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, Fujian 350007, P. R. China"}]},{"given":"Weihua","family":"Yang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2019,12,12]]},"reference":[{"key":"S0129054119500278BIB001","first-page":"393","volume-title":"Proceedings of the International Conference on Parallel Processing","author":"Akers S.","year":"1987"},{"key":"S0129054119500278BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"key":"S0129054119500278BIB003","doi-asserted-by":"publisher","DOI":"10.1002\/net.20126"},{"key":"S0129054119500278BIB004","first-page":"12","volume":"1","author":"Barefoot C. A.","year":"1987","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"S0129054119500278BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S0129054119500278BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.10.006"},{"key":"S0129054119500278BIB007","doi-asserted-by":"publisher","DOI":"10.2307\/2369306"},{"key":"S0129054119500278BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.01.013"},{"key":"S0129054119500278BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.03.011"},{"key":"S0129054119500278BIB010","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054107005108"},{"key":"S0129054119500278BIB011","first-page":"41","volume-title":"International Conference on Parallel and Distributed Systems","author":"Chou Z.-T.","year":"1996"},{"key":"S0129054119500278BIB012","first-page":"121","volume-title":"Lecture Notes in Computer Science","volume":"5574","author":"Chuang Y.","year":"2009"},{"key":"S0129054119500278BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/71.262586"},{"key":"S0129054119500278BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"S0129054119500278BIB015","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230207"},{"key":"S0129054119500278BIB016","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8937-6_5"},{"key":"S0129054119500278BIB017","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2011.650696"},{"key":"S0129054119500278BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.03.030"},{"key":"S0129054119500278BIB019","first-page":"175","volume-title":"Proceedings of the First Aizu International Symposium on Parallel Algorithms\/Architecture Synthesis","author":"Hu S.","year":"1995"},{"key":"S0129054119500278BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.11.030"},{"key":"S0129054119500278BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90054-O"},{"key":"S0129054119500278BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.10.017"},{"key":"S0129054119500278BIB023","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"S0129054119500278BIB024","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721649"},{"key":"S0129054119500278BIB025","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265903000763"},{"key":"S0129054119500278BIB026","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00600-5"},{"key":"S0129054119500278BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2016.09.002"},{"key":"S0129054119500278BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.10.009"},{"key":"S0129054119500278BIB029","doi-asserted-by":"publisher","DOI":"10.1142\/S021926590900256X"},{"key":"S0129054119500278BIB030","doi-asserted-by":"publisher","DOI":"10.1109\/ITNG.2009.51"},{"key":"S0129054119500278BIB031","first-page":"115","volume":"14","author":"Tchuente M.","year":"1982","journal-title":"Ars Combinatoria"},{"issue":"3","key":"S0129054119500278BIB032","first-page":"194","volume":"3","author":"Tsai T.-H.","year":"2012","journal-title":"Int. J. Innov. Manage. Technol."},{"key":"S0129054119500278BIB033","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2016.12.015"},{"key":"S0129054119500278BIB034","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.10.032"},{"key":"S0129054119500278BIB035","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7"},{"key":"S0129054119500278BIB036","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.09.001"},{"key":"S0129054119500278BIB037","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.05.001"},{"key":"S0129054119500278BIB038","doi-asserted-by":"publisher","DOI":"10.1080\/00207160410001661726"},{"key":"S0129054119500278BIB039","doi-asserted-by":"publisher","DOI":"10.1080\/0020716041233127208"},{"key":"S0129054119500278BIB040","doi-asserted-by":"publisher","DOI":"10.1080\/00207160500113173"},{"key":"S0129054119500278BIB041","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.04.011"},{"key":"S0129054119500278BIB042","doi-asserted-by":"publisher","DOI":"10.1109\/CISP.2010.5648134"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054119500278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T02:02:00Z","timestamp":1576202520000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054119500278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":42,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["10.1142\/S0129054119500278"],"URL":"https:\/\/doi.org\/10.1142\/s0129054119500278","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2019,12]]}}}