Selcuk, B.Tankul, A.N.A.Karci, A.2024-09-292024-09-2920211613-0073https://hdl.handle.net/20.500.14619/10085Freshcode4th International Workshop on Computer Modeling and Intelligent Systems, CMIS 2021 -- 27 April 2021 -- Zaporizhzhia -- 168925Honeycomb meshes can be seen widely in nature and are using in many different areas because of its properties. Using honeycomb meshes for constructing hierarchical structures has some advantages. In this study, hierarchical honeycomb meshes (HHM) are investigated. The construction of HHM is introduced with an example, topological properties of HHM explained in detail, a labeling algorithm in the process of the construction phase and also routing algorithms are given. This study shows a HHM(n) has a fractal structure and its graph is a Hamiltonian graph. © 2021 Copyright for this paper by its authors.eninfo:eu-repo/semantics/closedAccessGray codeHamilton graphHierarchical honeycomb meshesInterconnection networkNetwork topologyRoutingConference Object2-s2.0-85106202315495N/A4852864