{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:25:24Z","timestamp":1769977524259,"version":"3.49.0"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,4]]},"abstract":"<jats:p> A k-containerC(u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C(u, v) is a k*-container if every vertex of G is incident with a path in C(u, v). A graph G is k*-connected if there exists a k*-container between any two distinct vertices u and v. A k-regular graph G is super spanning connected if G is i*-connected for all 1 \u2264 i \u2264 k. In this paper, we prove that the (n, k)-star graph S<jats:sub>n,k<\/jats:sub> is super spanning connected if n \u2265 3 and (n-k) \u2265 2. <\/jats:p>","DOI":"10.1142\/s0129054106003905","type":"journal-article","created":{"date-parts":[[2006,4,3]],"date-time":"2006-04-03T05:47:03Z","timestamp":1144043223000},"page":"415-434","source":"Crossref","is-referenced-by-count":35,"title":["THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS"],"prefix":"10.1142","volume":"17","author":[{"given":"HONG-CHUN","family":"HSU","sequence":"first","affiliation":[{"name":"Department of Computer Science and Information Management, Providence University, Shalu, Taiwan 43301, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHENG-KUAN","family":"LIN","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National Central University, Chung-Li, Taiwan 32054, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HUA-MIN","family":"HUNG","sequence":"additional","affiliation":[{"name":"Department of Mathematics, National Central University, Chung-Li, Taiwan 32054, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LIH-HSING","family":"HSU","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Engineering, Ta Hwa Institute of Technology, Hsinchu, Taiwan 300, R.O.C."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"Akers S. B.","journal-title":"IEEE Trans. Comput."},{"key":"rf2","first-page":"193","volume":"24","author":"Albert M.","journal-title":"Australasian Journal of Combinatorics"},{"key":"rf3","volume-title":"Graph Theory with Applications","author":"Bondy J. A.","year":"1980"},{"key":"rf4","first-page":"259","volume":"56","author":"Chiang W. K.","journal-title":"Information Processing Letters"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054198000167"},{"key":"rf6","first-page":"668","volume":"77","author":"Hsu D. F.","journal-title":"IEICE Trans, Fundamentals"},{"key":"rf7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1002\/net.10096","volume":"42","author":"Hsu H. C.","journal-title":"Networks"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.02.007"},{"key":"rf9","first-page":"95","volume":"10","author":"Menger K.","journal-title":"Fund. Math."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106003905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:28:43Z","timestamp":1565177323000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106003905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":9,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,4]]}},"alternative-id":["10.1142\/S0129054106003905"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106003905","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}