{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:24Z","timestamp":1759063464599},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2017,9]]},"abstract":"<jats:p> We introduce cube-connected circulants as efficient models for communication networks. We give an algorithm for computing a shortest path between any pair of vertices in a cube-connected circulant. We give formulas for the diameter of a cube-connected circulant and the distance between any pair of vertices in such a graph. Then we give an embedding of cube-connected circulants into hypercubes, and an embedding of hypercubes into cube-connected circulants. We show cube-connected circulants outperform a few well-known network structures in several invariants. <\/jats:p>","DOI":"10.1142\/s0219265917410079","type":"journal-article","created":{"date-parts":[[2017,12,15]],"date-time":"2017-12-15T03:47:39Z","timestamp":1513309659000},"page":"1741007","source":"Crossref","is-referenced-by-count":2,"title":["Cube-Connected Circulants as Efficient Models for Interconnection Networks"],"prefix":"10.1142","volume":"17","author":[{"given":"HAMID","family":"MOKHTAR","sequence":"first","affiliation":[{"name":"School of Mathematics and Statistics, The University of Melbourne, Parkville VIC 3010, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2017,12,15]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.841743"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.06.002"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.04.022"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1145\/358645.358660"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00138-2"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00176-6"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2015.09.002"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788708000979"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2013.11.004"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054198000052"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2016.09.026"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321838"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(93)90054-O"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265917410079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:50:51Z","timestamp":1565128251000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265917410079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":13,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2017,12,15]]},"published-print":{"date-parts":[[2017,9]]}},"alternative-id":["10.1142\/S0219265917410079"],"URL":"https:\/\/doi.org\/10.1142\/s0219265917410079","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9]]}}}