IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Special Section on Parallel and Distributed Computing and Networking
Constructing Two Completely Independent Spanning Trees in Balanced Hypercubes
Yi-Xian YANGKung-Jui PAIRuay-Shiung CHANGJou-Ming CHANG
Author information

2019 Volume E102.D Issue 12 Pages 2409-2412


A set of spanning trees of a graphs G are called completely independent spanning trees (CISTs for short) if for every pair of vertices x, yV(G), the paths joining x and y in any two trees have neither vertex nor edge in common, except x and y. Constructing CISTs has applications on interconnection networks such as fault-tolerant routing and secure message transmission. In this paper, we investigate the problem of constructing two CISTs in the balanced hypercube BHn, which is a hypercube-variant network and is superior to hypercube due to having a smaller diameter. As a result, the diameter of CISTs we constructed equals to 9 for BH2 and 6n-2 for BHn when n≥3.

Information related to the author
© 2019 The Institute of Electronics, Information and Communication Engineers
Previous article Next article