On Embeddings of Hamiltonian Paths and Cycles in Extended Fibonacci Cubes
- 1 ,
Copyright: © 2020 Ioana Zelina, Grigor Moldovan and Ioana Tascu. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
The interconnection network is an essential component of a distributed system or of a supercomputer based on large-sale parallel processing. Because in distributed systems the communication between processors is based on message exchange, the network topology is of a great importance. The interconnection network can be seen as a graph and the properties of a network can be studied using combinatorics and graph theory. A number of interconnection network topologies have been studied. The Extended Fibonacci Cube, EFC, is a topology which provides good properties for an interconnection network regarding diameter, node degree, recursive decomposition, embeddability and communication algorithms. In this research we present some properties of the Extended Fibonacci Cubes, we define a Gray code for extended Fibonacci cubes and show how a hamiltonian path, a hamiltonian cycle and a 2D mesh can be embedded in an Extended Fibonacci Cube.
- Interconnection network
- extended Fibonacci cube
- Gray code
- hamiltonian path