Embedding Edge-Disjoint Spanning Trees on the Alternating Group Graphs

Abstract

In this paper we construct a graph that consists of the maximum number of directed edge-disjoint spanning trees on the alternating group graph. The paths that route from the common root node to any given node through different spanning trees are node-disjoint. This graph can be used to derive fault tolerant algorithms for the broadcasting and scattering problems under the all port communication model.