By Topic

All-fault-tolerant embedding of a complete binary tree in a group of Cayley graphs

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 $31
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)
Hsu, C.-C. ; Dept. of Inf. Manage., Nat. Taiwan Inst. of Technol., Taipei, Taiwan

The paper solves the problems of fault-tolerant embeddings of a complete binary tree in a group of Cayley graphs. First, a complete binary tree (CBT) is embedded into a complete-transposition graph. Then, the derived result is used to further induce the CBT embeddings for the other Cayley graphs. The primary results are that a CBT with height k×(n-2k+1)+(k-2)×2k+1, where k=[log n], can be embedded into an n-dimensional complete transposition graph (CTn), star graph (STn) and bubblesort graph (BS n) with dilations 1, 3, and 2n-3, respectively. Furthermore, a fault-tolerant scheme is developed to recover multiple faults up to the size of the embedded CBT with the least recovery cost. The dilations after recovery become at most 3, 5, and 2n-1 for the CTn, ST n, and BSn, respectively

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:143 ,  Issue: 2 )