{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:32:26Z","timestamp":1740133946606,"version":"3.37.3"},"reference-count":28,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"name":"Natural Science Foundation of Fujian Province, China","award":["2021J01860"],"award-info":[{"award-number":["2021J01860"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301217"],"award-info":[{"award-number":["11301217"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:p> Let [Formula: see text], [Formula: see text] and [Formula: see text] be non-negative integers. The generalized Johnson graph [Formula: see text] is the graph whose vertices are the [Formula: see text]-subsets of the set [Formula: see text], and two vertices are adjacent if and only if they intersect with [Formula: see text] elements. Special cases of generalized Johnson graph include the Kneser graph [Formula: see text] and the Johnson graph [Formula: see text]. These graphs play an important role in coding theory, Ramsey theory, combinatorial geometry and hypergraphs theory. In this paper, we discuss the connectivity properties of the Kneser graph [Formula: see text] and [Formula: see text] by their symmetric properties. Specifically, with the help of some properties of vertex\/edge-transitive graphs we prove that [Formula: see text] [Formula: see text] and [Formula: see text] [Formula: see text] are super restricted edge-connected. Besides, we obtain the exact value of the restricted edge-connectivity and the cyclic edge-connectivity of the Kneser graph [Formula: see text] [Formula: see text] and [Formula: see text] [Formula: see text], and further show that the Kneser graph [Formula: see text] [Formula: see text] is super vertex-connected and super cyclically edge-connected. <\/jats:p>","DOI":"10.1142\/s012905412350017x","type":"journal-article","created":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T15:10:30Z","timestamp":1695827430000},"page":"579-593","source":"Crossref","is-referenced-by-count":0,"title":["On the Super (Edge)-Connectivity of Generalized Johnson Graphs"],"prefix":"10.1142","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8702-490X","authenticated-orcid":false,"given":"Zhecheng","family":"Yu","sequence":"first","affiliation":[{"name":"School of Science, Jimei University, Xiamen, Fujian 361021, P. R. China"},{"name":"Digital Fujian Big Data Modeling and Intelligent Computing Institute, Jimei University, Xiamen, Fujian 361021, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2060-9289","authenticated-orcid":false,"given":"Liqiong","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Science, Jimei University, Xiamen, Fujian 361021, P. R. China"},{"name":"Digital Fujian Big Data Modeling and Intelligent Computing Institute, Jimei University, Xiamen, Fujian 361021, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1393-4950","authenticated-orcid":false,"given":"Xuemin","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Science, Jimei University, Xiamen, Fujian 361021, P. R. China"},{"name":"Digital Fujian Big Data Modeling and Intelligent Computing Institute, Jimei University, Xiamen, Fujian 361021, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1348-4389","authenticated-orcid":false,"given":"Chuanye","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Science, Jimei University, Xiamen, Fujian 361021, P. R. China"},{"name":"Digital Fujian Big Data Modeling and Intelligent Computing Institute, Jimei University, Xiamen, Fujian 361021, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2023,9,27]]},"reference":[{"key":"S012905412350017XBIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2017.08.022"},{"key":"S012905412350017XBIB002","first-page":"258","volume":"343","author":"Balbuena C.","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"S012905412350017XBIB003","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190080406"},{"volume-title":"Extremal Graph Theory","year":"1978","author":"Bollob\u00e1s B.","key":"S012905412350017XBIB004"},{"key":"S012905412350017XBIB005","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"2","key":"S012905412350017XBIB006","first-page":"201","volume":"82","author":"Chen Y.-L.","year":"2022","journal-title":"Australas. J. Combin."},{"key":"S012905412350017XBIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(87)90044-X"},{"key":"S012905412350017XBIB008","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(02)00223-0"},{"key":"S012905412350017XBIB009","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2051"},{"key":"S012905412350017XBIB010","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90025-7"},{"key":"S012905412350017XBIB011","doi-asserted-by":"publisher","DOI":"10.1201\/b10959"},{"key":"S012905412350017XBIB012","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130303"},{"key":"S012905412350017XBIB013","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199903)33:2<157::AID-NET6>3.0.CO;2-D"},{"key":"S012905412350017XBIB014","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00391-8"},{"key":"S012905412350017XBIB015","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0067376"},{"volume-title":"Combinatorial Network Theory","year":"1996","author":"Tindell R.","key":"S012905412350017XBIB016"},{"key":"S012905412350017XBIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.04.024"},{"key":"S012905412350017XBIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.10.001"},{"volume-title":"Combinatorial Theory in Networks","year":"2013","author":"Xu J.-M.","key":"S012905412350017XBIB019"},{"key":"S012905412350017XBIB020","first-page":"3","volume":"111","author":"Xu J.-M.","year":"2013","journal-title":"Ars. Combin."},{"key":"S012905412350017XBIB021","doi-asserted-by":"publisher","DOI":"10.1007\/s40840-015-0286-y"},{"key":"S012905412350017XBIB022","doi-asserted-by":"publisher","DOI":"10.1049\/cje.2016.05.023"},{"key":"S012905412350017XBIB023","doi-asserted-by":"publisher","DOI":"10.3390\/sym14020304"},{"key":"S012905412350017XBIB024","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-019-02031-4"},{"key":"S012905412350017XBIB025","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2304391"},{"key":"S012905412350017XBIB026","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.12.004"},{"key":"S012905412350017XBIB027","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-014-9759-4"},{"key":"S012905412350017XBIB028","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9472-0"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905412350017X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T03:05:58Z","timestamp":1720494358000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S012905412350017X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,27]]},"references-count":28,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["10.1142\/S012905412350017X"],"URL":"https:\/\/doi.org\/10.1142\/s012905412350017x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2023,9,27]]}}}