{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:58:41Z","timestamp":1764784721772,"version":"3.41.2"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:p>We consider the class of generalized hypercubes constructed recursively from the graph [Formula: see text] by repeatedly taking two copies of such a graph with a perfect matching added in between. We show that all graphs obtained this way have very good connectivity properties. They are all maximally connected, and even when linearly many vertices are deleted, the remaining graph will have a large connected component with only a few vertices in other components. We also show examples that we can delete more vertices in certain graphs in this class to get the second largest component to have certain sizes, including the case when we get two components of equal size. We conjecture that these examples are best possible.<\/jats:p>","DOI":"10.1142\/s0219265921500158","type":"journal-article","created":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T14:06:48Z","timestamp":1629468408000},"source":"Crossref","is-referenced-by-count":1,"title":["Connectivity Properties of Generalized K4-Hypercubes"],"prefix":"10.1142","volume":"21","author":[{"given":"Joshua","family":"Brudnak","sequence":"first","affiliation":[{"name":"Oakland University, Rochester, MI 48309, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3","family":"Lipt\u00e1k","sequence":"additional","affiliation":[{"name":"Oakland University, Rochester, MI 48309, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2021,10,12]]},"reference":[{"key":"S0219265921500158BIB001","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2012.735234"},{"key":"S0219265921500158BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.12.009"},{"key":"S0219265921500158BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.05.034"},{"issue":"2","key":"S0219265921500158BIB004","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1002\/net.20319","volume":"55","author":"Cheng E.","year":"2010","journal-title":"Networks"},{"key":"S0219265921500158BIB005","doi-asserted-by":"publisher","DOI":"10.1002\/net.21476"},{"key":"S0219265921500158BIB006","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265915500073"},{"key":"S0219265921500158BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.09.042"},{"key":"S0219265921500158BIB008","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626415500061"},{"volume-title":"Introduction to Graph Theory","year":"2017","author":"West D. B.","key":"S0219265921500158BIB009"},{"key":"S0219265921500158BIB010","doi-asserted-by":"publisher","DOI":"10.1080\/00207160410001661726"},{"key":"S0219265921500158BIB011","doi-asserted-by":"publisher","DOI":"10.1080\/0020716041233127208"},{"key":"S0219265921500158BIB012","doi-asserted-by":"publisher","DOI":"10.1080\/00207160500113173"},{"key":"S0219265921500158BIB013","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008994"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265921500158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,18]],"date-time":"2021-10-18T18:03:05Z","timestamp":1634580185000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265921500158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":13,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["10.1142\/S0219265921500158"],"URL":"https:\/\/doi.org\/10.1142\/s0219265921500158","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"type":"print","value":"0219-2659"},{"type":"electronic","value":"1793-6713"}],"subject":[],"published":{"date-parts":[[2021,9]]},"article-number":"2150015"}}