By Topic

Extended Fibonacci cubes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Jie Wu ; Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL, USA

The Fibonacci cube (FC) is an interconnection network that possesses many desirable properties that are important in network design and application. However, most Fibonacci cubes (more than two third of all) are not Hamiltonian. In this paper, we propose a new network topology called extended Fibonacci cube (EFC1) based on the same sequence F(i)=F(i-1)+F(i-2) as the regular Fibonacci sequence but with different initial values. We also propose a series of extended Fibonacci cubes with even number of nodes. Any extended Fibonacci cube (EFCk, with k⩾1) in the series contains the node set of any other cube that precedes EFCk in the series. We show that any extended Fibonacci cube maintains virtually all the desirable properties of the Fibonacci cube. EFCk's can be considered as flexible versions of incomplete hypercubes which eliminate the restriction on the number of nodes and thus makes it possible to construct parallel machines with arbitrary sizes

Published in:

Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on

Date of Conference:

25-28 Oct 1995