Answers are grounded in this paper and cite their sources.
In 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.
No takes yet. Share an insight, caveat, or question.
Burhan Selçuk (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: