Completely independent spanning trees in torus networks

Authors:
Toru Hasunuma;Chie Morisaka
Affiliations:
Department of Mathematical and Natural Sciences, The University of Tokushima, 1–1 Minamijosanjima, Tokushima 770–8502, Japan;Department of Mathematical and Natural Sciences, The University of Tokushima, 1–1 Minamijosanjima, Tokushima 770–8502, Japan
Venue:
Networks
Year:
2012

Citing 19
Cited 0

The multi-tree approach to reliability in distributed networks

Information and Computation
Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs

Journal of Algorithms
Hamilton decompositions of cartesian products of graphs

Discrete Mathematics
Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs

SIAM Journal on Computing
Independent spanning trees of chordal rings

Information Processing Letters
On edge-disjoint spanning trees in hypercubes

Information Processing Letters
Independent spanning trees with small depths in iterated line digraphs

Discrete Applied Mathematics
Completely independent spanning trees in the underlying graph of a line digraph

Discrete Mathematics
Multicast in wormhole-switched torus networks using edge-disjoint spanning trees

Journal of Parallel and Distributed Computing
Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance

IEEE Transactions on Computers
Completely Independent Spanning Trees in Maximal Planar Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Constructing Edge-Disjoint Spanning Trees in Product Networks

IEEE Transactions on Parallel and Distributed Systems
Finding Four Independent Trees

SIAM Journal on Computing
Edge-disjoint spanning trees for the generalized butterfly networks and their applications

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Parallel construction of optimal independent spanning trees on hypercubes

Parallel Computing
Vertex disjoint routings of cycles over tori

Networks - Dedicated to Leonhard Euler (1707–1783)
On the independent spanning trees of recursive circulant graphs G(cdm,d) with d2

Theoretical Computer Science
Independent Spanning Trees on Multidimensional Torus Networks

IEEE Transactions on Computers
Balancing two spanning trees

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let T1, T2, …, Tk be spanning trees in a graph G. If for any two vertices u, v in G, the paths from u to v in T1, T2, …, Tk are pairwise internally disjoint, then T1, T2, …, Tk 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. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.