Perfect Matching of Fractal Honeycomb Meshes

Authors : Burhan Selçuk, Ayşe Nur Altintaş Tankül

Pages : 38-46

View : 18 | Download : 8

Publication Date : 2019-06-01

Article Type : Research

Abstract :In this paper, we investigated Hamiltonian properties of fractal honeycomb meshes which are created in two different ways using 2-bit gray code. We presented the structure of honeycomb meshes and examined the fractal properties of them and got perfect matching of labeling of nodes in Fractal Honeycomb Meshes for any dimension. Network topology is an illustration of nodes and their connections. There are different types of network topologies and bus, ring, star, tree, mesh, tori and hypercube topologies are the most commonly known network topologies. In this paper, we used honeycomb pattern to construct network topology in fractal-like structure with two variants of honeycomb meshes and examined their Hamilton properties.
Keywords : Fractal honeycomb meshes, Interconnection network, Hamilton graph, Perfect matching, Gray code