On the independent spanning trees of recursive circulant graphs G(cdm,d) with d2

  • Authors:

  • Jinn-Shyong Yang;Jou-Ming Chang;Shyue-Ming Tang;Yue-Li Wang

  • Affiliations:

  • Department of Information Management, National Taipei College of Business, Taipei, Taiwan, ROC;Department of Information Management, National Taipei College of Business, Taipei, Taiwan, ROC;Department of Psychology, National Defense University, Taipei, Taiwan, ROC;Department of Information Management, National Taiwan University of Science and Technology, Taipei, Taiwan, ROC

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2009

Quantified Score

Hi-index 5.23

Visualization

Abstract

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 vr 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=2, where the number of independent spanning trees matches the connectivity of G(cd^m,d).