a b s t r a c tHypercube is a popular and more attractive interconnection networks. The attractive properties of hypercube caused the derivation of more variants of hypercube. In this paper, we have proposed two variants of hypercube which was called as "Fractal Cubic Network Graphs", and we have investigated the Hamiltonian-like properties of Fractal Cubic Network Graphs FCNG r ðnÞ. Firstly, Fractal Cubic Network Graphs FCNG r ðnÞ are defined by a fractal structure. Further, we show the construction and characteristics analyses of FCNG r ðnÞ where r ¼ 1 or r ¼ 2. Therefore, FCNG r ðnÞ is a Hamiltonian graph which is obtained by using Gray Code for r ¼ 2 and FCNG 1 ðnÞ is not a Hamiltonian Graph. Furthermore, we have obtained a recursive algorithm which is used to label the nodes of FCNG 2 ðnÞ. Finally, we get routing algorithms on FCNG 2 ðnÞ by utilizing routing algorithms on the hypercubes.