By Topic

Embedding of generalized Fibonacci cubes in hypercubes with faulty nodes

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

3 Author(s)
Feng-Shr Jiang ; Inst. of Technol., Nat. Taiwan Inst. of Technol., Taipei, Taiwan ; Shi-Jinn Horng ; Tzong-Wann Kao

The generalized Fibonacci cubes (abbreviated to GFCs) were recently proposed as a class of interconnection topologies, which cover a spectrum ranging from regular graphs such as the hypercube to semiregular graphs such as the second order Fibonacci cube. It has been shown that the kth order GFC of dimension n+k is equivalent to an n-cube for 0⩽n<k; and it is a proper subgraph of an n-cube for n⩾k. Thus, a kth order GFC of dimension n+k can be obtained from the n-cube for all n⩾k by removing certain nodes from an n-cube. This problem is very simple when no faulty node exists in an k-cube; but it becomes very complex if some faulty nodes appear in an n-cube. In this paper, we first consider the following open problem: How can a maximal (in terms of the number of nodes) generalized Fibonacci cube be distinguished from a faulty hypercube which can also be considered as a fault-tolerant embedding in hypercubes. Then, we shall show how to directly embed a GFC into a faulty hypercube and prove that if no more than three faulty nodes exist, then an [n/2]th order GFC of dimension n+[n/2] can be directly embedded into an n-cube in the worst case, for n=4 or n⩾6

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:8 ,  Issue: 7 )