Completely independent spanning trees in torus networks
Copyright policy )Completely independent spanning trees in torus networks
AbstractLet 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
- University of Tokushima Japan
Network design and communication in computer systems, torus network, Trees, edge-disjoint spanning trees, completely independent spanning trees, Graph theory (including graph drawing) in computer science, Cartesian product, fault tolerance, Mathematical problems of computer architecture, interconnection network
Network design and communication in computer systems, torus network, Trees, edge-disjoint spanning trees, completely independent spanning trees, Graph theory (including graph drawing) in computer science, Cartesian product, fault tolerance, Mathematical problems of computer architecture, interconnection network
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).56 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!