{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:32:19Z","timestamp":1740133939543,"version":"3.37.3"},"reference-count":30,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"DOI":"10.13039\/100009377","name":"Education Department of Hunan Province","doi-asserted-by":"publisher","award":["2019RS1057"],"award-info":[{"award-number":["2019RS1057"]}],"id":[{"id":"10.13039\/100009377","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2022,1]]},"abstract":"<jats:p> The Cayley graph generated by a transposition tree [Formula: see text] is a class of Cayley graphs that contains the star graph and the bubble sort graph. A graph [Formula: see text] is called strongly Menger (SM for short) (edge) connected if each pair of vertices [Formula: see text] are connected by [Formula: see text] (edge)-disjoint paths, where [Formula: see text] are the degree of [Formula: see text] and [Formula: see text] respectively. In this paper, the maximally edge-fault-tolerant and the maximally vertex-fault-tolerant of [Formula: see text] with respect to the SM-property are found and thus generalize or improve the results in [19, 20, 22, 26] on this topic. <\/jats:p>","DOI":"10.1142\/s0129054121500349","type":"journal-article","created":{"date-parts":[[2021,10,14]],"date-time":"2021-10-14T16:38:52Z","timestamp":1634229532000},"page":"33-43","source":"Crossref","is-referenced-by-count":3,"title":["The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees"],"prefix":"10.1142","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6331-0183","authenticated-orcid":false,"given":"Pingshan","family":"Li","sequence":"first","affiliation":[{"name":"Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education, School of Mathematics and Computational Science, Xiangtan University, Xiangtan, Hunan 411105, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computational Science, Xiangtan University, Xiangtan, Hunan 411105, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianglin","family":"Liu","sequence":"additional","affiliation":[{"name":"Xingjian College of Science and Liberal Arts, Guangxi University, Nanning, Guangxi 530004, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,10,14]]},"reference":[{"key":"S0129054121500349BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"key":"S0129054121500349BIB002","doi-asserted-by":"publisher","DOI":"10.1002\/net.20126"},{"key":"S0129054121500349BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.10.006"},{"key":"S0129054121500349BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.03.022"},{"key":"S0129054121500349BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.05.034"},{"key":"S0129054121500349BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.03.011"},{"key":"S0129054121500349BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00162-1"},{"volume-title":"Isomorphism of transposition graphs, Tech. Rep., L.R.I.","year":"1997","author":"Delorme C.","key":"S0129054121500349BIB008"},{"key":"S0129054121500349BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90030-Y"},{"key":"S0129054121500349BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/12.42131"},{"key":"S0129054121500349BIB011","doi-asserted-by":"crossref","unstructured":"C. Godsil and  G. Royle ,  Algebraic Graph Theory  (Springer-Verlag,  New York,  2000),  pp. 52\u201354.","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"S0129054121500349BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.09.047"},{"key":"S0129054121500349BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.04.001"},{"key":"S0129054121500349BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.10.019"},{"key":"S0129054121500349BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90060-M"},{"key":"S0129054121500349BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.09.013"},{"key":"S0129054121500349BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.10.017"},{"key":"S0129054121500349BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.12.024"},{"key":"S0129054121500349BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.06.016"},{"key":"S0129054121500349BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.04.012"},{"key":"S0129054121500349BIB021","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"S0129054121500349BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00600-5"},{"key":"S0129054121500349BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2016.09.002"},{"key":"S0129054121500349BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.10.009"},{"key":"S0129054121500349BIB026","doi-asserted-by":"publisher","DOI":"10.1142\/S021926590900256X"},{"key":"S0129054121500349BIB027","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.09.002"},{"key":"S0129054121500349BIB028","first-page":"115","volume":"14","author":"Tchuente M.","year":"1982","journal-title":"Ars Combin."},{"key":"S0129054121500349BIB029","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054121500179"},{"key":"S0129054121500349BIB030","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.09.001"},{"key":"S0129054121500349BIB031","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2017.05.001"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054121500349","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,20]],"date-time":"2022-01-20T13:58:31Z","timestamp":1642687111000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054121500349"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,14]]},"references-count":30,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["10.1142\/S0129054121500349"],"URL":"https:\/\/doi.org\/10.1142\/s0129054121500349","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2021,10,14]]}}}