An Algorithm to Find Optimal Independent Spanning Trees on Twisted-Cubes

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 TN_n, where N denotes the number of vertices in TN_n. And for n ≥ 3, the height of each independent spanning tree on TN_n is n+1.