Let T 1 , T 2 , . . . , T k be spanning trees in a graph G. If for any two vertices u, v in G, the paths from u to v in T 1 , T 2 , . . . , T k are pairwise internally disjoint, then T 1 , T 2 , . . . , T k are completely independent spanning trees in G. Completely independent spanning trees can be applied to fault-tolerant communication problems in interconnection networks. In this article, we show that there are two completely independent spanning trees in any torus network. Besides, we generalize the result for the Cartesian product. In particular, we show that there are two completely independent spanning trees in the Cartesian product of any 2-connected graphs.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.