On Embeddings of Hamiltonian Paths and Cycles in Extended Fibonacci Cubes | Science Publications

American Journal of Applied Sciences

Ioana Zelina¹  Grigor Moldovan¹  Ioana Tascu¹ 

关键词: Interconnection network;    extended Fibonacci cube;    embeddings;    Gray code;    hamiltonian path;   

DOI  :  10.3844/ajassp.2008.1605.1610

学科分类：自然科学（综合）

来源: Science Publications

【 摘 要 】

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 base 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.

【 授权许可】

Unknown