{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T14:51:21Z","timestamp":1784386281358,"version":"3.55.0"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p> This paper considers R<jats:sub>h<\/jats:sub>-connectivity of the (n, k)-star graph S<jats:sub>n,k<\/jats:sub>, denoted by \u03ba<jats:sup>h<\/jats:sup>(S<jats:sub>n,k<\/jats:sub>). In this note, We determine \u03ba<jats:sup>h<\/jats:sup>(S<jats:sub>n,k<\/jats:sub>) = n+h(k\u22122)\u22121 for 2 \u2264 k \u2264 n\u22121 and 0 \u2264 h \u2264 n\u2212k. The results generalize the main result in proved by W. H. Yang et al. [Information Processing Letters, 110(2010), 1007\u20131011] for the R<jats:sub>1<\/jats:sub>-connectivity (\u03ba<jats:sup>1<\/jats:sup>(S<jats:sub>n,k<\/jats:sub>)) and R<jats:sub>2<\/jats:sub>-connectivity (\u03ba<jats:sup>2<\/jats:sup>(S<jats:sub>n,k<\/jats:sub>)). <\/jats:p>","DOI":"10.1142\/s0129054113500317","type":"journal-article","created":{"date-parts":[[2014,4,2]],"date-time":"2014-04-02T06:43:49Z","timestamp":1396421029000},"page":"1235-1241","source":"Crossref","is-referenced-by-count":14,"title":["GENERALIZED CONNECTIVITY OF (n, k)-STAR GRAPHS"],"prefix":"10.1142","volume":"24","author":[{"given":"YUNCHAO","family":"WEI","sequence":"first","affiliation":[{"name":"College of Information Technology, Shanghai Ocean University, Shanghai, 201306, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"FUGUANG","family":"CHEN","sequence":"additional","affiliation":[{"name":"College of Information Technology, Shanghai Ocean University, Shanghai, 201306, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2014,4]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.262126"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00162-1"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.08.015"},{"key":"p_5","first-page":"176","volume":"1995","author":"Hu C. B","journal-title":"Proceedings of the First Aizu International Symposium on Parallel Algorithms\/Architecture Synthesis"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2008.03.021"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1002\/net.10096"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113500317","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:48:21Z","timestamp":1565200101000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113500317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":6,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2014,4]]},"published-print":{"date-parts":[[2013,12]]}},"alternative-id":["10.1142\/S0129054113500317"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113500317","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}