{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T04:11:12Z","timestamp":1745381472552},"reference-count":35,"publisher":"World Scientific Pub Co Pte Lt","issue":"01n02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2012,3]]},"abstract":"<jats:p> Graph embedding has been known as a powerful tool for implementation of parallel algorithms and simulation of interconnection networks. In this paper, we introduce a technique to obtain a lower bound for the dilation of an embedding. Moreover, we give algorithms for embedding variants of hypercubes with dilation 2 proving that the lower bound obtained is sharp. Further, we compute the exact wirelength of embedding folded hypercubes and augmented cubes into hypercubes. <\/jats:p>","DOI":"10.1142\/s0219265912500041","type":"journal-article","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T02:52:46Z","timestamp":1362970366000},"page":"1250004","source":"Crossref","is-referenced-by-count":6,"title":["EMBEDDING VARIANTS OF HYPERCUBES WITH DILATION 2"],"prefix":"10.1142","volume":"13","author":[{"given":"PAUL","family":"MANUEL","sequence":"first","affiliation":[{"name":"Department of Information Science, Kuwait University, Safat, 13060, Kuwait"}]},{"given":"INDRA","family":"RAJASINGH","sequence":"additional","affiliation":[{"name":"School of Advanced Sciences, VIT University, Chennai, 600 127, India"}]},{"given":"R.","family":"SUNDARA RAJAN","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Tagore Engineering College, Chennai, 600 127, India"}]}],"member":"219","published-online":{"date-parts":[[2013,3,10]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.04.007"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.09.003"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<75::AID-JGT1>3.0.CO;2-S"},{"key":"p_5","first-page":"693","author":"Bezrukov S.L.","year":"1998","journal-title":"Mortar Fine Control System"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00098-5"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1013"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00256-0"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.05.026"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.06.029"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.06.001"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.12.010"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00227-2"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00224-9"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00161-4"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2008.10.040"},{"issue":"10","key":"p_18","first-page":"1849","volume":"308","author":"Vodopivec A.","year":"1847","journal-title":"Discrete Mathematics"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1002\/net.20027"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.013"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.4236\/am.2010.16065"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.04.023"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-7315(03)00037-6"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.12.001"},{"key":"p_26","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.07.003"},{"key":"p_27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.03.006"},{"issue":"15","key":"p_28","first-page":"1978","volume":"89","author":"Rajasingh I.","year":"1970","journal-title":"International Journal of Computer Mathematics"},{"key":"p_29","doi-asserted-by":"publisher","DOI":"10.1109\/12.2234"},{"key":"p_30","doi-asserted-by":"publisher","DOI":"10.1002\/net.10033"},{"key":"p_31","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00162-4"},{"key":"p_32","doi-asserted-by":"publisher","DOI":"10.1109\/71.159036"},{"key":"p_33","doi-asserted-by":"publisher","DOI":"10.1007\/s000260050003"},{"key":"p_36","doi-asserted-by":"publisher","DOI":"10.1109\/12.4611"},{"key":"p_38","doi-asserted-by":"publisher","DOI":"10.1109\/71.642951"},{"key":"p_39","doi-asserted-by":"publisher","DOI":"10.1007\/BF01204731"},{"key":"p_40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.11.003"},{"key":"p_41","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-011-0085-2"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265912500041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:08:07Z","timestamp":1565190487000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265912500041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":35,"journal-issue":{"issue":"01n02","published-online":{"date-parts":[[2013,3,10]]},"published-print":{"date-parts":[[2012,3]]}},"alternative-id":["10.1142\/S0219265912500041"],"URL":"https:\/\/doi.org\/10.1142\/s0219265912500041","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}