Constructing edge-disjoint spanning trees in augmented cubes
Combinatorics
2017-06-19 v1
Abstract
Let T1, T2,.... Tk be spanning trees in a graph G. If for any pair of vertices u and v of G, the paths between u and v in every Ti( 0 < i < k+1) do not contain common edges then T1, T2,.... Tk are called edge-disjoint spanning trees in G. The design of multiple edge-disjoint spanning trees has applications to the reliable communication protocols. The n-dimensional augmented cube, denoted as AQn, a variation of the hypercube, possesses some properties superior to those of the hypercube. For AQn (n > 2), construction of n-1 edge-disjoint spanning trees is given the result is optimal with respect to the number of edge-disjoint spanning trees.
Keywords
Cite
@article{arxiv.1706.05215,
title = {Constructing edge-disjoint spanning trees in augmented cubes},
author = {S. A. Mane},
journal= {arXiv preprint arXiv:1706.05215},
year = {2017}
}
Comments
Total number of pages 5 including 8 figures