{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:16Z","timestamp":1759638616471,"version":"3.37.3"},"reference-count":16,"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":["11571044","61373021"],"award-info":[{"award-number":["11571044","61373021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Fundamental Research Funds for the Guangxi Provincial Education Department","award":["YB2014007"],"award-info":[{"award-number":["YB2014007"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2017,12]]},"abstract":"<jats:p> A [Formula: see text]-container [Formula: see text] of a graph [Formula: see text] is a set of [Formula: see text] internally disjoint paths between [Formula: see text] and [Formula: see text]. A [Formula: see text]-container [Formula: see text] of [Formula: see text] is a [Formula: see text]-container if it is a spanning subgraph of [Formula: see text]. A graph [Formula: see text] is [Formula: see text]-connected if there exists a [Formula: see text]-container between any two different vertices of G. A [Formula: see text]-regular graph [Formula: see text] is super spanning connected if [Formula: see text] is [Formula: see text]-container for all [Formula: see text]. In this paper, we prove that the arrangement graph [Formula: see text] is super spanning connected if [Formula: see text] and [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054117500381","type":"journal-article","created":{"date-parts":[[2018,2,26]],"date-time":"2018-02-26T01:42:48Z","timestamp":1519609368000},"page":"1047-1072","source":"Crossref","is-referenced-by-count":7,"title":["The Super Spanning Connectivity of Arrangement Graphs"],"prefix":"10.1142","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6331-0183","authenticated-orcid":false,"given":"Pingshan","family":"Li","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Beijing Normal University, Laboratory of Mathematics and Complex Systems, Ministry of Education, Beijing 100875, P. R. China"}]},{"given":"Min","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Beijing Normal University, Laboratory of Mathematics and Complex Systems, Ministry of Education, Beijing 100875, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2018,2,25]]},"reference":[{"key":"S0129054117500381BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"issue":"1","key":"S0129054117500381BIB003","first-page":"193","volume":"24","author":"Albert M.","year":"2001","journal-title":"Australas. J. Combin."},{"volume-title":"Graph theory with applications","year":"1980","author":"Bondy J. A.","key":"S0129054117500381BIB004"},{"key":"S0129054117500381BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00052-0"},{"key":"S0129054117500381BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90030-Y"},{"key":"S0129054117500381BIB007","doi-asserted-by":"publisher","DOI":"10.1109\/12.238494"},{"key":"S0129054117500381BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1255789"},{"key":"S0129054117500381BIB009","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054106003905"},{"key":"S0129054117500381BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.02.007"},{"issue":"6","key":"S0129054117500381BIB011","first-page":"257","volume":"92","author":"Li J.","year":"2015","journal-title":"Int. J. Fundations Comput. Sci."},{"key":"S0129054117500381BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.05.002"},{"key":"S0129054117500381BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/71.910874"},{"key":"S0129054117500381BIB014","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"S0129054117500381BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.04.035"},{"key":"S0129054117500381BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.06.046"},{"key":"S0129054117500381BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.05.013"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054117500381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T08:38:11Z","timestamp":1569227891000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054117500381"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":16,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2018,2,25]]},"published-print":{"date-parts":[[2017,12]]}},"alternative-id":["10.1142\/S0129054117500381"],"URL":"https:\/\/doi.org\/10.1142\/s0129054117500381","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"type":"print","value":"0129-0541"},{"type":"electronic","value":"1793-6373"}],"subject":[],"published":{"date-parts":[[2017,12]]}}}