Selcuk, BurhanKarci, Ali2024-09-292024-09-2920172215-0986https://doi.org/10.1016/j.jestch.2017.04.005https://hdl.handle.net/20.500.14619/4862Hypercube is a popular interconnection network. Due to the popularity of hypercube, more researchers pay a great effort to develop the different variants of hypercube. In this paper, we have proposed a variant of hypercube which is called as Connected Cubic Network Graphs, and have investigated the Hamilton-like properties of Connected Cubic Network Graphs (CCNG). Firstly, we defined CCNG and showed the characteristic analyses of CCNG. Then, we showed that the CCNG has the properties of Hamilton graph, and can be labeled using a Gray coding based recursive algorithm. Finally, we gave the comparison results, a routing algorithm and a bitonic sort algorithm for CCNG. In case of sparsity and cost, CCNG is better than Hypercube. (C) 2017 Karabuk University. Publishing services by Elsevier B.V.eninfo:eu-repo/semantics/openAccessHamilton pathHypercubeGray codeInterconnection networkConnected Cubic Network GraphArticle10.1016/j.jestch.2017.04.0052-s2.0-850213758159433Q193420WOS:000410699300010N/A