Selcuk, BurhanTankuel, Ayse Nur Altintas2024-09-292024-09-2920232215-0986https://doi.org/10.1016/j.jestch.2023.101454https://hdl.handle.net/20.500.14619/4918Connected Square Network Graphs (CSNG) in the study of Selcuk (2022) and Selcuk and Tankul (2022) is reconsidered in this paper. Although (CSNG) is a 2-dimensional mesh structure, the most important feature of this graph is that it is a hypercube variant. For this reason, this study focuses on development algorithms that find solutions to various problems for (CSNG) with the help of hypercube. Firstly, an efficient algorithm that finds the Hamiltonian path is given. Further, two different algorithms that perform the mapping of labels in graph and the unicast routing are given. Furthermore, the parallel process for mapping and unicast routing is discussed. Finally, guidelines are given for broadcasting algorithms. & COPY; 2023 Karabuk University. Publishing services by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).eninfo:eu-repo/semantics/openAccessMeshesHamiltonian pathRoutingBroadcastingArticle10.1016/j.jestch.2023.1014542-s2.0-85164016978Q144WOS:001040384300001Q1