This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Balanced Spanning Trees in Complete and Incomplete Star Graphs
July 1996 (vol. 7 no. 7)
pp. 717-723

Abstract—Efficiently solving the personalized broadcast problem in an interconnection network typically relies on finding an appropriate spanning tree in the network. In this paper, we show how to construct in a complete star graph an asymptotically balanced spanning tree, and in an incomplete star graph a near-balanced spanning tree. In both cases, the tree is shown to have the minimum height. In the literature, this problem has only been considered for the complete star graph, and the constructed tree is about 4/3 times taller than the one proposed in this paper.

[1] S.B. Akers, D. Harel, and B. Krishnameurthy, "The Star Graph: An Attractive Alternative to the n-Cube," Proc. Int'l Conf. Parallel Processing, pp. 393-400, 1987.
[2] S.G. Akl, K. Qiu, and I. Stojmenovic, "Data Communication and Computational Geometry on the Star and Pancake Interconnection Networks," Proc. Third IEEE Symp. Parallel and Distributed Systems, pp. 415-422,Dallas, Dec. 1991.
[3] K. Day and A. Tripathi, "A Comparative Study of Topological Properties of Hypercubes and Star Graphs," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 31-38, Jan. 1994.
[4] 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.
[5] J.-S. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embeddings of Cycles and Grids in Star Graphs," Proc. Symp. Parallel and Distributed Processing, pp. 540-547, 1990.
[6] S. Latifi and N. Bagherzadeh, "Incomplete Star: An Incrementally Scalable Network Based on the Star Graph," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 97-102, Jan. 1994.
[7] V.E. Mendia and D. Sarkar, “Optimal Broadcasting in the Star Graph,” IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 389-396, July 1992.
[8] J. Misic and Z. Jovanovic, "Communication Aspects of the Star Graph Interconnection Network," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 7, pp. 678-687, July 1994.
[9] M. Nigam, S. Sahni, and B. Krishnamurthy, "Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs," Proc. Int'l Conf. Parallel Processing, pp. III-340-343, 1990.
[10] X. Shen, Q. Hu, B. Cong, H. Sudborough, M. Girou, and S. Bettayeb, "The 4-star graph is not a subgraph of any hypercube," Information Processing Letters, vol. 45, pp. 199-203, 1993.
[11] J.-P. Sheu, C.-T. Liaw, and T.-S. Chen, “A Broadcasting Algorithm in Star Graph Interconnection Networks,” Information Processing Letters, vol. 48, pp. 237-241, 1993.
[12] J.-P. Sheu, C.-T. Liaw, and T.-S. Chen, “An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, June 1995.

Index Terms:
Balanced spanning tree, interconnection network, parallel architecture, personalized broadcast, star graph.
Citation:
Tzung-Shi Chen, Yu-Chee Tseng, Jang-Ping Sheu, "Balanced Spanning Trees in Complete and Incomplete Star Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 7, pp. 717-723, July 1996, doi:10.1109/71.508251
Usage of this product signifies your acceptance of the Terms of Use.