By Topic

Constructing Independent Spanning Trees for Hypercubes and Locally Twisted 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

4 Author(s)
Yi-Jiun Liu ; Dept. of Appl. Math., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Chou, W.Y. ; Lan, J.K. ; Chiuyuan Chen

Multiple independent spanning trees (ISTs) have applications to fault-tolerant and data broadcasting in interconnections. Thus the designs of multiple ISTs in several classes of networks have been widely investigated. There are two versions of the n ISTs conjecture. The vertex (edge) conjecture is that any n-connected (n-edge-connected) graph has n vertex-ISTs (edge-ISTs) rooted at an arbitrary vertex r. Note that the vertex conjecture implies the edge conjecture. Recently, Hsieh and Tu proposed an algorithm to construct -ISTs rooted at vertex 0 for the n-dimensional locally twisted cube (LTQn), which is a variant of the ndimensional hypercube (Qn). Since LTQn is not vertextransitive, Hsieh and Tu's result does not solve the edge conjecture for LTQn. In the paper, we confirm the vertex conjecture (and hence also the edge conjecture) for LTQn by proposing an algorithm to construct n vertex-ISTs rooted at any vertex. We also confirm the vertex (and also the edge) conjecture for Qn. To the best of our knowledge, our algorithm is the first algorithm that can construct n vertexISTs rooted at any vertex for both LTQn and Qn.

Published in:

Pervasive Systems, Algorithms, and Networks (ISPAN), 2009 10th International Symposium on

Date of Conference:

14-16 Dec. 2009