{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T16:36:45Z","timestamp":1781023005639,"version":"3.54.1"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,6]]},"abstract":"<jats:p> The exchanged hypercube EH(s, t), proposed by Loh et al. [The exchanged hypercube, IEEE Trans. Parallel Distri. Syst.16 (2005) 866\u2013874], is obtained by systematically removing links from a binary hypercube Q<jats:sub>n<\/jats:sub>. This paper determines that the connectivity and the edge connectivity of EH(s, t) are s + 1 where s \u2264 t. That is, for s \u2264 t, at least s + 1 vertices (resp. s + 1 edges) of EH(s, t) are removed to get a disconnected graph. <\/jats:p>","DOI":"10.1142\/s1793830910000590","type":"journal-article","created":{"date-parts":[[2010,7,5]],"date-time":"2010-07-05T10:31:23Z","timestamp":1278325883000},"page":"213-220","source":"Crossref","is-referenced-by-count":40,"title":["THE CONNECTIVITY OF EXCHANGED HYPERCUBES"],"prefix":"10.1142","volume":"02","author":[{"given":"MEIJIE","family":"MA","sequence":"first","affiliation":[{"name":"Department of Mathematics, Zhejiang Normal University, Jinhua, 321004, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90355-W"},{"key":"rf2","first-page":"88","volume":"48","author":"Cao F.","journal-title":"IEEE Trans. Comput."},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2009.09.002"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1006"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(98)10041-3"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.08.012"},{"key":"rf7","first-page":"866","volume":"16","author":"Lou P. K. K.","journal-title":"IEEE Trans. Parallel Distr. Sys."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190100103"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.09.005"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.11.003"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.01.126"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000590","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:20:43Z","timestamp":1565140843000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000590"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":12,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2010,6]]}},"alternative-id":["10.1142\/S1793830910000590"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000590","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6]]}}}