Parallel Architectures, Algorithms and Programming, International Symposium on (2011)

Tianjin, China

Dec. 9, 2011 to Dec. 11, 2011

ISBN: 978-0-7695-4575-2

pp: 52-56

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2011.59

ABSTRACT

Multiple independent spanning trees have applications to fault tolerance and data broadcasting in distributed networks. There is a conjecture on independent spanning trees: any n-connected graph has n independent spanning trees rooted at an arbitrary vertex. The conjecture has been confirmed only for n-connected graphs with n=4, and it is still open for arbitrary n-connected graphs when n ≥ 5. In this paper, we provide a construction algorithm to find n independent spanning trees for the n-dimensional twisted-cube TNn, where N denotes the number of vertices in TNn. And for n ≥ 3, the height of each indepen- dent spanning tree on TNn is n+1.

INDEX TERMS

broadcasting; independent spanning tree; fault tolerance; twisted-cube

CITATION

Y. Wang, Y. Han and J. Fan, "An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes,"

*Parallel Architectures, Algorithms and Programming, International Symposium on(PAAP)*, Tianjin, China, 2011, pp. 52-56.

doi:10.1109/PAAP.2011.59

CITATIONS