{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T21:22:02Z","timestamp":1771104122393,"version":"3.50.1"},"reference-count":29,"publisher":"World Scientific Pub Co Pte Ltd","issue":"08","funder":[{"name":"Science and Engineering Research Board for funding under Teachers Associateship for Research Excellence","award":["TAR\/2023\/000041"],"award-info":[{"award-number":["TAR\/2023\/000041"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:p>Graph embedding is the major technique which is used to map guest graph into host graph. In architecture simulation, graph embedding is said to be one of the strongest application for the execution of parallel algorithms and simulation of various interconnection networks. In the recent paper\u00a0[ 1 ], Berin et\u00a0al. proposed a novel approach for embedding an augmented hypercube into a tree-like networks and provided the minimum wirelength of the resulting embedding, and they mentioned that this problem is open for other guest networks. In this paper, we solve one of the open problems by considering folded hypercube as the guest network. Additionally, we discuss the implementation of rooted complete binary tree in Network On Chips. Our findings contribute to the optimization of VLSI layout and provide insights into the design of efficient network structures.<\/jats:p>","DOI":"10.1142\/s0129054125500066","type":"journal-article","created":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T05:37:07Z","timestamp":1742276227000},"page":"1205-1225","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Layout of Embedding onto Folded Hypercubes"],"prefix":"10.1142","volume":"36","author":[{"given":"Rini Dominic","family":"D","sequence":"first","affiliation":[{"name":"Department of Mathematics, Hindustan Institute of Technology and Science, Chennai, 603103, India"}]},{"given":"R.","family":"Sundara Rajan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hindustan Institute of Technology and Science, Chennai, 603103, India"}]},{"given":"T. M.","family":"Rajalaxmi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Sri Sivasubramaniya Nadar College of Engineering, Chennai, 603110, India"}]},{"given":"L.","family":"Packiaraj","sequence":"additional","affiliation":[{"name":"Department of Mathematics, J.P. College of Arts and Science, Ayikudi, Tenkasi, 627852, India"}]}],"member":"219","published-online":{"date-parts":[[2025,3,18]]},"reference":[{"key":"S0129054125500066BIB001","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054123500090"},{"key":"S0129054125500066BIB002","first-page":"132","volume":"24","author":"Chen W. K.","year":"1995","journal-title":"Inform. Sci."},{"key":"S0129054125500066BIB003","doi-asserted-by":"publisher","DOI":"10.3390\/math7050383"},{"key":"S0129054125500066BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.03.006"},{"key":"S0129054125500066BIB005","author":"Guo R.","year":"2023","journal-title":"Int. J. Found. Comp. Sci."},{"key":"S0129054125500066BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.05.034"},{"key":"S0129054125500066BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.06.011"},{"key":"S0129054125500066BIB008","doi-asserted-by":"publisher","DOI":"10.1051\/ro:2004027"},{"issue":"2","key":"S0129054125500066BIB009","first-page":"185","volume":"18","author":"Rajan R. S.","year":"2023","journal-title":"Iranian J. Math. Sci. Inform."},{"key":"S0129054125500066BIB010","author":"Rajan R. S.","year":"2024","journal-title":"J. Interconnection Netw."},{"key":"S0129054125500066BIB011","series-title":"Mathematics and Statistic","volume-title":"Optimizing Wirelength in Graph Embedding: Folded Hypercube into Fan and Windmill Networks \u2014 A Comparative Study. ICCE 2023","author":"Dominic R.","year":"2024"},{"key":"S0129054125500066BIB012","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00644"},{"key":"S0129054125500066BIB013","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00562"},{"key":"S0129054125500066BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00256-0"},{"key":"S0129054125500066BIB015","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2008.10.040"},{"key":"S0129054125500066BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.12.001"},{"key":"S0129054125500066BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.04.023"},{"key":"S0129054125500066BIB018","first-page":"693","volume":"1450","author":"Bezrukov S. L.","year":"1998","journal-title":"Math. Found. Comput. Sci."},{"key":"S0129054125500066BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.013"},{"key":"S0129054125500066BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2008.08.011"},{"key":"S0129054125500066BIB021","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu031"},{"key":"S0129054125500066BIB022","doi-asserted-by":"publisher","DOI":"10.1109\/71.642951"},{"key":"S0129054125500066BIB023","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511616679"},{"key":"S0129054125500066BIB024","doi-asserted-by":"publisher","DOI":"10.1007\/BF01204731"},{"key":"S0129054125500066BIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2015.03.001"},{"key":"S0129054125500066BIB026","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-011-0085-2"},{"key":"S0129054125500066BIB027","doi-asserted-by":"publisher","DOI":"10.1137\/0207026"},{"key":"S0129054125500066BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.12.007"},{"key":"S0129054125500066BIB029","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2014048"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054125500066","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:07:33Z","timestamp":1765357653000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129054125500066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,18]]},"references-count":29,"journal-issue":{"issue":"08","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["10.1142\/S0129054125500066"],"URL":"https:\/\/doi.org\/10.1142\/s0129054125500066","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,18]]}}}