{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:26:32Z","timestamp":1769156792268,"version":"3.49.0"},"reference-count":23,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11731002"],"award-info":[{"award-number":["11731002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Fundamental Research Funds for the Central Universities","award":["2016JBZ012"],"award-info":[{"award-number":["2016JBZ012"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2019,8]]},"abstract":"<jats:p> The connectivity plays an important role in measuring the fault tolerance and reliability of interconnection networks. The generalized [Formula: see text]-connectivity of a graph [Formula: see text], denoted by [Formula: see text], is an important indicator of a network\u2019s ability for fault tolerance and reliability. The bubble-sort star graph, denoted by [Formula: see text], is a well known interconnection network. In this paper, we show that [Formula: see text] for [Formula: see text], that is, for any three vertices in [Formula: see text], there exist [Formula: see text] internally disjoint trees connecting them in [Formula: see text] for [Formula: see text], which attains the upper bound of [Formula: see text] given by Li et al. for [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054119500229","type":"journal-article","created":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T04:24:14Z","timestamp":1565670254000},"page":"793-809","source":"Crossref","is-referenced-by-count":22,"title":["The Generalized Connectivity of Bubble-Sort Star Graphs"],"prefix":"10.1142","volume":"30","author":[{"given":"Shu-Li","family":"Zhao","sequence":"first","affiliation":[{"name":"Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8714-8750","authenticated-orcid":false,"given":"Rong-Xia","family":"Hao","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Beijing Jiaotong University, Beijing 100044, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"S0129054119500229BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S0129054119500229BIB002","first-page":"1","volume":"2","author":"Chartrand G.","year":"1984","journal-title":"Bull. Bombay Math. Colloq."},{"key":"S0129054119500229BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.10.006"},{"issue":"4","key":"S0129054119500229BIB004","first-page":"360","volume":"55","author":"Chartrand G.","year":"2010","journal-title":"Networks"},{"key":"S0129054119500229BIB005","first-page":"41","volume-title":"International Conference on Parallel and Disturbed Systems","author":"Chou Z.","year":"1996"},{"key":"S0129054119500229BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.06.043"},{"key":"S0129054119500229BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.07.026"},{"key":"S0129054119500229BIB008","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230230207"},{"key":"S0129054119500229BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-8937-6_5"},{"key":"S0129054119500229BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.commatsci.2011.09.003"},{"key":"S0129054119500229BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-017-1837-9"},{"key":"S0129054119500229BIB012","first-page":"193","volume":"114","author":"Li H.","year":"2014","journal-title":"Ars Comb."},{"key":"S0129054119500229BIB013","first-page":"41","volume":"274","author":"Li S.","year":"2016","journal-title":"Appl. Math. Comput."},{"key":"S0129054119500229BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9399-x"},{"key":"S0129054119500229BIB015","first-page":"77","volume":"295","author":"Li H.","year":"2017","journal-title":"Appl. Math. Comput."},{"key":"S0129054119500229BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.04.011"},{"key":"S0129054119500229BIB017","first-page":"65","volume":"104","author":"Li S.","year":"2012","journal-title":"Ars Comb."},{"key":"S0129054119500229BIB018","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.12.003"},{"key":"S0129054119500229BIB019","first-page":"199","volume":"44","author":"Shi H.","year":"2008","journal-title":"Comput. Eng. Appl."},{"key":"S0129054119500229BIB020","doi-asserted-by":"publisher","DOI":"10.2307\/2371086"},{"key":"S0129054119500229BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.09.047"},{"key":"S0129054119500229BIB022","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxw037"},{"key":"S0129054119500229BIB023","author":"Zhao S.","year":"2018","journal-title":"Discret. Appl. Math."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054119500229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T04:24:44Z","timestamp":1565670284000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054119500229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":23,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2019,8,13]]},"published-print":{"date-parts":[[2019,8]]}},"alternative-id":["10.1142\/S0129054119500229"],"URL":"https:\/\/doi.org\/10.1142\/s0129054119500229","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8]]}}}