The multi-tree approach to reliability in distributed networks
Information and Computation
Information Processing Letters
Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
SIAM Journal on Computing
Efficient Broadcasting in Wormhole-Routed Multicomputers: A Network-Partitioning Approach
IEEE Transactions on Parallel and Distributed Systems
Independent spanning trees of chordal rings
Information Processing Letters
Independent spanning trees with small depths in iterated line digraphs
Discrete Applied Mathematics
Journal of Systems Architecture: the EUROMICRO Journal
Finding Four Independent Trees
SIAM Journal on Computing
Node-pancyclicity and edge-pancyclicity of hypercube variants
Information Processing Letters
Parallel construction of optimal independent spanning trees on hypercubes
Parallel Computing
Reducing the Height of Independent Spanning Trees in Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
Constructing edge-disjoint spanning trees in locally twisted cubes
Theoretical Computer Science
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Discrete Applied Mathematics
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
An algorithm to construct independent spanning trees on parity cubes
Theoretical Computer Science
Independent spanning trees in crossed cubes
Information Sciences: an International Journal
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
Journal of Parallel and Distributed Computing
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
| Hi-index | 5.23 |
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 LTQ"n. The very recent algorithm proposed by Hsieh and Tu (2009) [12] is designed to construct n edge-ISTs rooted at vertex 0 for LTQ"n. However, we find out that LTQ"n is not vertex-transitive when n=4; therefore Hsieh and Tu's result does not solve the Edge Conjecture for LTQ"n. In this paper, we propose an algorithm for constructing n vertex-ISTs for LTQ"n; consequently, we confirm the Vertex Conjecture (and hence also the Edge Conjecture) for LTQ"n.