{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T15:44:19Z","timestamp":1768751059775,"version":"3.49.0"},"reference-count":21,"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":["61502286"],"award-info":[{"award-number":["61502286"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004480","name":"Natural Science Foundation of Shanxi Province","doi-asserted-by":"publisher","award":["20210302123438"],"award-info":[{"award-number":["20210302123438"]}],"id":[{"id":"10.13039\/501100004480","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:p> The [Formula: see text]-star graph [Formula: see text], which is introduced to address scaling issues of the star graph, is recognized as an attractive interconnection network topology for building multiprocessor systems because of its desirable properties. Let [Formula: see text] be the minimum number of faulty vertices that make every subgraph isomorphic to [Formula: see text] faulty in [Formula: see text] under vertex-failure model, where [Formula: see text]. In this paper, we prove that [Formula: see text], [Formula: see text], [Formula: see text], and [Formula: see text] for [Formula: see text] and [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054122500095","type":"journal-article","created":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T10:36:40Z","timestamp":1650278200000},"page":"439-451","source":"Crossref","is-referenced-by-count":6,"title":["Subnetwork Preclusion of (n,k)-Star Networks"],"prefix":"10.1142","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3990-0009","authenticated-orcid":false,"given":"Kai","family":"Feng","sequence":"first","affiliation":[{"name":"School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi 030006, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2022,4,18]]},"reference":[{"key":"S0129054122500095BIB001","first-page":"393","volume-title":"Proceedings of International Conference of Parallel Processing","author":"Akers S. B.","year":"1987"},{"key":"S0129054122500095BIB002","volume-title":"Introductory Combinatorics","author":"Brualdi R. A.","year":"1999","edition":"3"},{"key":"S0129054122500095BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S0129054122500095BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.24"},{"key":"S0129054122500095BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00162-1"},{"key":"S0129054122500095BIB006","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2014.2354912"},{"key":"S0129054122500095BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.01.035"},{"key":"S0129054122500095BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.11.051"},{"key":"S0129054122500095BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.11.012"},{"key":"S0129054122500095BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.10"},{"key":"S0129054122500095BIB011","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3025009"},{"key":"S0129054122500095BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.12.013"},{"key":"S0129054122500095BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.09.013"},{"key":"S0129054122500095BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2014.10.006"},{"key":"S0129054122500095BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.03.025"},{"key":"S0129054122500095BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.03.002"},{"key":"S0129054122500095BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.11.016"},{"key":"S0129054122500095BIB018","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2014.988615"},{"key":"S0129054122500095BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.06.013"},{"key":"S0129054122500095BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.06.011"},{"key":"S0129054122500095BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.04.010"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054122500095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T04:05:51Z","timestamp":1660277151000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054122500095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,18]]},"references-count":21,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["10.1142\/S0129054122500095"],"URL":"https:\/\/doi.org\/10.1142\/s0129054122500095","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,18]]}}}