In this paper, we investigated Hamiltonian properties of honeycomb meshes which are created in two different ways. We obtained different Hamilton paths for Honeycomb Meshes for any dimension with using n-bit gray code. Finally, we gave an algorithm which is used to label the nodes of Honeycomb Meshes.Interconnection networks are formed of different components of mechanism and connections between them. A network topology is the pattern for connecting one element to other elements and it may vary depending on formation such as tree, bus, mesh, star, ring, hypercube and tori. In this paper, to construct network topology, we use honeycomb meshes using two different structuring, show labeling with gray codes and then analyze Hamilton properties of honeycomb meshes.
|Konular||Bilgisayar Bilimleri, Bilgi Sistemleri|
: 21 Ocak 2019
|APA||Selçuk, B , Altıntaş Tankül, A . (2019). On Hamiltonian Properties of Honeycomb Meshes . Computer Science , 4 (1) , 29-37 . Retrieved from https://dergipark.org.tr/tr/pub/bbd/issue/43306/515701|