This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Constructing Edge-Disjoint Spanning Trees in Product Networks
March 2003 (vol. 14 no. 3)
pp. 213-221

Abstract—A Cartesian product network is obtained by applying the cross operation on two graphs. In this paper, we study the problem of constructing the maximum number of edge-disjoint spanning trees (abbreviated to EDSTs) in Cartesian product networks. Let G=(V_G, E_G) be a graph having n_1 EDSTs and F=(V_F, E_F) be a graph having n_2 EDSTs. Two methods are proposed for constructing EDSTs in the Cartesian product of G and F , denoted by G\times F . The graph G has t_1=|E_G|-n_1(|V_G|-1) more edges than that are necessary for constructing n_1 EDSTs in it, and the graph F has t_2=|E_F|-n_2(|V_F|-1) more edges than that are necessary for constructing n_2 EDSTs in it. By assuming that t_1\ge n_1 and t_2 \ge n_2 , our first construction shows that n_1+ n_2 EDSTs can be constructed in G \times F . Our second construction does not need any assumption and it constructs n_1 + n_2-1 EDSTs in G \times F . By applying the proposed methods, it is easy to construct the maximum numbers of EDSTs in many important Cartesian product networks, such as hypercubes, tori, generalized hypercubes, mesh connected trees, and hyper Petersen networks.

[1] F. Bao, Y. Igarashi, and S.R. Öhring, “Reliable Broadcasting in Product Networks,” Discrete Applied Math., vol. 83, pp. 3-20, 1998.
[2] B. Barden, R. Libeskind-Hadas, J. Davis, and W. Williams, “On Edge-Disjoint Spanning Trees in Hypercubes,” Information Processing Letters, vol. 70, pp. 13-16, 1999.
[3] S. Bettayeb, “On the$\big. k{\hbox{-}}{\rm{ary}}\bigr.$Hypercube,” Theoretical Computer Science, vol. 140, no. 2, pp. 333-339, 1995.
[4] J.-C. Bermond, “Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs,” Annals of Discrete Math., vol. 3, pp. 31-38, 1978.
[5] S.K. Das, S.R. Öhring, and A.K. Banerjee, “Embeddings Into Hyper Petersen Network: Yet Another Hypercube-Like Interconnection Topology,” VLSI Design, vol. 2, no. 4, pp. 335-351, 1995.
[6] K. Day and A.E. Al-Ayyoub, “The Cross Product of Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 2, pp. 109-118, Feb. 1997.
[7] V.V. Dimakopoulos and N.J. Dimopoulos, “A Theory for Total Exchange in Multidimensional Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 9, no. 7, pp. 639-649, July 1998.
[8] K. Efe and A. Fernandez, “Computational Properties of Mesh Connected Trees: Versatile Architecture for Parallel Computation,” Proc. Int'l Conf. Parallel Processing, pp. 72-76, 1994.
[9] A. Fernández and K. Efe, “Generalized Algorithm for Parallel Sorting on Product Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 12, pp. 1211-1225, 1997.
[10] A. Fernández and K. Efe, "Efficient VLSI Layouts for Homogeneous Product Networks," IEEE Trans. Computers, vol. 46, no. 10, pp. 1,070-1,082, Oct. 1997.
[11] P. Fragopoulou and S.G. Akl, “Edge-Disjoint Spanning Trees on the Star Network with Applications to Fault Tolerance,” IEEE Trans. Computers, vol. 45, no. 2, pp. 174-185, Feb. 1996.
[12] P. Fragopoulou, P.S.G. Akl, and H. Meijer, “Optimal Communication Primitives on the Generalized Hypercube Network,” J. Parallel and Distributed Computing, vol. 32, no. 2, pp. 173-187, 1996.
[13] F. Harary, “On the Group of the Composition of Two Graphs,” Duke Math. J., vol. 26, 1959.
[14] T. Hasunuma, “On Edge-Disjoint Spanning Trees With Small Depths,” Information Processing Letters, vol. 75, pp. 71-74, 2000.
[15] A. Itai and M. Rodeh, “The Multi-Tree Approach to Reliability in Distributed Networks,” Information and Computation, vol. 79, pp. 43-59, 1988.
[16] S.L. Johnsson and C.T. Ho,“Spanning graphs for optimum broadcasting and personalizedcommunication in hypercubes,” IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
[17] R. Libeskind-Hadas, D. Mazzoni, and R. Rajagopalan, “Tree-Based Multicasting in Wormhole-Routed Irregular Topologies,” Proc. Merged 12th Int'l Parallel Processing Symp. and the Ninth Symp. Parallel and Distributed Processing, pp. 244-249, Apr. 1998.
[18] G. Sabidussi, “The Composition of Graphs,” Duke Math. J., vol. 26, pp. 693-696, 1959.
[19] R. Stong, “Hamilton Decompositions of Cartesian Products of Graphs,” Discrete Math., vol. 90, pp. 169-190, 1991.
[20] J. Roskind and R. Tarjan, “A Note on Finding Maximum-Cost Edge-Disjoint Spanning Trees,” Math. Operations Research, vol. 10, no. 2, pp. 701-708, Nov. 1985.
[21] H. Wang and D. Blough, “Construction of Edge-Disjoint Spanning Trees in the Torus and Application to Multicast in Wormhole-Routed Networks,” Proc. Int'l Conf. Parallel and Distributed Computing Systems, 1999.

Index Terms:
Cartesian product networks, edge-disjoint trees, spanning trees, embedding, fault-tolerance, interconnection networks.
Citation:
Shan-Chyun Ku, Biing-Feng Wang, Ting-Kai Hung, "Constructing Edge-Disjoint Spanning Trees in Product Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 3, pp. 213-221, March 2003, doi:10.1109/TPDS.2003.1189580
Usage of this product signifies your acceptance of the Terms of Use.