{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:18:34Z","timestamp":1778595514288,"version":"3.51.4"},"reference-count":26,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2025,3]]},"abstract":"<jats:p> Graph embedding is a fundamental problem in computer science. Let [Formula: see text] (resp., [Formula: see text]) be the interconnection network for a parallel computer system [Formula: see text] (resp., [Formula: see text]). If [Formula: see text] could be embedded into [Formula: see text], then [Formula: see text] can simulate [Formula: see text]\u2019s behavior. The [Formula: see text]-ary [Formula: see text]-cube [Formula: see text] is a node-symmetric and link-symmetric recursive interconnection network for parallel computer systems. Let [Formula: see text] be a prescribed linear forest of [Formula: see text], and let [Formula: see text] and [Formula: see text] be any two distinct nodes in [Formula: see text] such that [Formula: see text] has no path with [Formula: see text] or [Formula: see text] as internal nodes, or both as end-nodes. This paper shows that there is a Hamiltonian path passing through [Formula: see text] between [Formula: see text] and [Formula: see text] in [Formula: see text] with [Formula: see text] and odd [Formula: see text] even if the number of links in [Formula: see text] is up to [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0219265924500038","type":"journal-article","created":{"date-parts":[[2024,3,8]],"date-time":"2024-03-08T07:21:55Z","timestamp":1709882515000},"source":"Crossref","is-referenced-by-count":2,"title":["Embedding Hamiltonian Paths with Prescribed Linear Forests into k-ary n-Cube Networks"],"prefix":"10.1142","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4868-7220","authenticated-orcid":false,"given":"Kaiyue","family":"Meng","sequence":"first","affiliation":[{"name":"School of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, P. R. China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0755-1764","authenticated-orcid":false,"given":"Yuxing","family":"Yang","sequence":"additional","affiliation":[{"name":"Henan Engineering Laboratory for Big Data and Statistical Analysis and Optimal Control, Henan Normal University, Xinxiang, Henan 453007, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2024,3,7]]},"reference":[{"key":"S0219265924500038BIB001","doi-asserted-by":"publisher","DOI":"10.1147\/rd.492.0265"},{"key":"S0219265924500038BIB002","doi-asserted-by":"publisher","DOI":"10.1145\/509593.509632"},{"key":"S0219265924500038BIB003","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480196311183"},{"key":"S0219265924500038BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"S0219265924500038BIB005","doi-asserted-by":"publisher","DOI":"10.1109\/12.403718"},{"key":"S0219265924500038BIB006","doi-asserted-by":"publisher","DOI":"10.1177\/109434209200600303"},{"key":"S0219265924500038BIB007","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20128"},{"key":"S0219265924500038BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80039-0"},{"key":"S0219265924500038BIB009","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103432805"},{"key":"S0219265924500038BIB010","doi-asserted-by":"publisher","DOI":"10.1002\/net.20290"},{"key":"S0219265924500038BIB011","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-007-0133-5"},{"key":"S0219265924500038BIB013","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.211"},{"key":"S0219265924500038BIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.01.027"},{"key":"S0219265924500038BIB015","doi-asserted-by":"publisher","DOI":"10.1109\/40.87568"},{"key":"S0219265924500038BIB016","doi-asserted-by":"publisher","DOI":"10.1145\/2465.2467"},{"key":"S0219265924500038BIB017","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.45"},{"key":"S0219265924500038BIB018","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70787"},{"key":"S0219265924500038BIB019","doi-asserted-by":"publisher","DOI":"10.1109\/PDCAT.2005.148"},{"key":"S0219265924500038BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.03.011"},{"key":"S0219265924500038BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.09.007"},{"key":"S0219265924500038BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.05.008"},{"key":"S0219265924500038BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.10.004"},{"key":"S0219265924500038BIB024","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.09.020"},{"key":"S0219265924500038BIB025","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265920500012"},{"key":"S0219265924500038BIB026","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3126254"},{"key":"S0219265924500038BIB027","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2311794"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265924500038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T02:12:50Z","timestamp":1738807970000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0219265924500038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,7]]},"references-count":26,"journal-issue":{"issue":"01","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10.1142\/S0219265924500038"],"URL":"https:\/\/doi.org\/10.1142\/s0219265924500038","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,7]]},"article-number":"2450003"}}