Selçuk, B.2024-09-292024-09-2920222619-9653https://doi.org/10.32323/ujma.1058116https://hdl.handle.net/20.500.14619/8992In this study, connected square network graphs are introduced and two different definitions are given. Firstly, connected square network graphs are shown to be a Hamilton graph. Further, the labelling algorithm of this graph is obtained by using gray code. Finally, its topological properties are obtained, and conclusion are given. © 2022, Emrah Evren KARA. All rights reserved.eninfo:eu-repo/semantics/openAccessGraphical indicesHamilton graphInterconnection networkArticle10.32323/ujma.10581162-s2.0-85163944644632N/A575