On the independent spanning trees of recursive circulant graphs G(cd(m), d) with d > 2
Two spanning trees of a graph G are said to be independent if they are rooted at the same vertex r, and for each vertex v not equal r in G, the two different paths from v to r, one path in each tree, are internally disjoint. A set of spanning trees of G is independent if they are pairwise independent. The construction of multiple independent spanning trees has many applications in network communication. For instance, it is useful for fault-tolerant broadcasting and secure message distribution, A recursive circulant graph G(N, d) has N = cd(m) vertices labeled from 0 to N - 1, where d >= 2, m >= 1, and 1  = k   2, where the number of independent spanning trees matches the connectivity of G(cd(m), d). Crown Copyright (C) 2008 Published by Elsevier B.V. All rights reserved.
independent spanning trees recursive circulant graphs fault-tolerant broadcasting secure message distribution internally disjoint paths