Topology properties of hierarchical honeycomb meshes
Küçük Resim Yok
Tarih
2021
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
CEUR-WS
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Honeycomb 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.
Açıklama
Freshcode
4th International Workshop on Computer Modeling and Intelligent Systems, CMIS 2021 -- 27 April 2021 -- Zaporizhzhia -- 168925
4th International Workshop on Computer Modeling and Intelligent Systems, CMIS 2021 -- 27 April 2021 -- Zaporizhzhia -- 168925
Anahtar Kelimeler
Gray code, Hamilton graph, Hierarchical honeycomb meshes, Interconnection network, Network topology, Routing
Kaynak
CEUR Workshop Proceedings
WoS Q Değeri
Scopus Q Değeri
N/A
Cilt
2864
