Constructing independent spanning trees for locally twisted cubes

Citations of this article
Mendeley users who have this article in their library.


The independent spanning trees (ISTs) problem attempts to construct a set of pairwise independent spanning trees and it has numerous applications in networks such as data broadcasting, scattering and reliable communication protocols. The well-known ISTs conjecture, Vertex/Edge Conjecture, states that any n-connected/n-edge-connected graph has n vertex-ISTs/edge-ISTs rooted at an arbitrary vertex r. It has been shown that the Vertex Conjecture implies the Edge Conjecture. In this paper, we consider the independent spanning trees problem on the n-dimensional locally twisted cube LTQn. The very recent algorithm proposed by Hsieh and Tu (2009) [12] is designed to construct n edge-ISTs rooted at vertex 0 for LTQn. However, we find out that LTQn is not vertex-transitive when n<4; therefore Hsieh and Tu's result does not solve the Edge Conjecture for LTQn. In this paper, we propose an algorithm for constructing n vertex-ISTs for LTQn; consequently, we confirm the Vertex Conjecture (and hence also the Edge Conjecture) for LTQn. © 2010 Elsevier B.V. All rights reserved.




Liu, Y. J., Lan, J. K., Chou, W. Y., & Chen, C. (2011). Constructing independent spanning trees for locally twisted cubes. Theoretical Computer Science, 412(22), 2237–2252.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free