{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T04:34:40Z","timestamp":1769056480237,"version":"3.49.0"},"reference-count":14,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:p>Generalized connectivity is a parameter of evaluating the reliability of a network. Let [Formula: see text] be a vertex set of graph [Formula: see text] and [Formula: see text], there is a tree in [Formula: see text] as it connects all vertices of [Formula: see text] which is called a [Formula: see text]-tree. Let [Formula: see text] and [Formula: see text] be two [Formula: see text]-trees in [Formula: see text]. If [Formula: see text] and [Formula: see text] are given, we define that two [Formula: see text]-trees [Formula: see text] and [Formula: see text] are internally disjoint. Then the maximum number of internally disjoint [Formula: see text]-trees in [Formula: see text] is denoted by [Formula: see text]. For an integer [Formula: see text] with [Formula: see text], the generalized [Formula: see text]-connectivity of a graph [Formula: see text] is denoted as [Formula: see text]. In this paper, we study the generalized [Formula: see text]-connectivity of alternating group graphs, denoted by [Formula: see text]. We show the upper bound and the lower bound of [Formula: see text], [Formula: see text] for [Formula: see text], and that [Formula: see text] is given.<\/jats:p>","DOI":"10.1142\/s0219265921500110","type":"journal-article","created":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T09:28:30Z","timestamp":1626859710000},"page":"2150011","source":"Crossref","is-referenced-by-count":2,"title":["The Bounds of Generalized 4-Connectivity of Alternating Group Graphs"],"prefix":"10.1142","volume":"21","author":[{"given":"Cheng","family":"Jin","sequence":"first","affiliation":[{"name":"Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai-Yi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Wei","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P. R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,7,18]]},"reference":[{"key":"S0219265921500110BIB001","volume-title":"Graph Theory","author":"Bondy J. A.","year":"2007"},{"key":"S0219265921500110BIB002","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230414"},{"key":"S0219265921500110BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80005-9"},{"key":"S0219265921500110BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.05.059"},{"key":"S0219265921500110BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.08.010"},{"key":"S0219265921500110BIB006","doi-asserted-by":"publisher","DOI":"10.2307\/2371086"},{"key":"S0219265921500110BIB007","first-page":"1","volume":"2","author":"Chartrand G.","year":"1984","journal-title":"Bombay Math."},{"key":"S0219265921500110BIB008","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9399-x"},{"key":"S0219265921500110BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2019.06.006"},{"key":"S0219265921500110BIB010","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.amc.2018.11.023","volume":"347","author":"Zhao S. L.","year":"2019","journal-title":"Appl. Math. Comput."},{"key":"S0219265921500110BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33828-6_1"},{"key":"S0219265921500110BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.09.022"},{"key":"S0219265921500110BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.09.001"},{"key":"S0219265921500110BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.12.003"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265921500110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T08:56:02Z","timestamp":1699260962000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265921500110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":14,"journal-issue":{"issue":"02","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["10.1142\/S0219265921500110"],"URL":"https:\/\/doi.org\/10.1142\/s0219265921500110","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6]]}}}