Increasing the Connectivity of the Star Graphs

Networks

Volumn 40, Issue 3, 2002, Pages 165-169

  Cheng, Eddie ^a   Lipman, Marc J ^a  

^a OAKLAND UNIVERSITY   (United States)

Author keywords

Augmentation; Connectivity; Interconnection networks

Indexed keywords

GRAPH THEORY; PARALLEL PROCESSING SYSTEMS; THEOREM PROVING; TOPOLOGY;

AUGMENTATION;

INTERCONNECTION NETWORKS;

EID: 0141764683     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10045     Document Type: Article

References (28)

1. S.B. Akers, D. Harel, and B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, Proc Int Conf Parallel Processing, St. Charles, IL, 1987, pp. 393-400.
2. N. Bagherzadeh, M. Dowd, and S. Latifi, A well-behaved enumeration of star graphs, IEEE Trans Parallel Distr Syst 6 (1995), 531-535.
3. D. Bauer, F. Boesch, C. Suffel, and R. Tindell, "Connectivity extremal problems and the design of reliable probabilistic networks," The theory and application of graphs, Y. Alavi and G. Chartrand (Editors), Wiley, New York, 1981, pp. 89-98.
4. L.N. Bhuyan and D.P. Agrawal, Generalized hypercube and hyperbus structures for a computer network, IEEE Trans Comput 33 (1984), 323-333.
5. E.D. Bolker and H. Crapo, How to brace a one-story building, Environ Plan B 4 (1997), 125-152.
6. T.S. Chen, Y.C. Tseng, and J.P. Sheu, Balanced spanning trees in complete and incomplete star graphs, IEEE Trans Parallel Distr Syst 7 (1996), 717-723.
7. E. Cheng and T. Jordan, Successive edge augmentation problems, Math Prog (Series B) 84 (1999), 577-593.
8. E. Cheng and M.J. Lipman, Vulnerability issues of star graphs and split-stars: Strength and toughness, Discr Appl Math 118 (2002), 163-179.
9. E. Cheng and M.J. Lipman, On the Day-Tripathi orientation of the star graphs: Connectivity, Inform Proc Lett 73 (2000), 5-10.
10. W.K. Chiang and R.J. Chen, The (n, k)-star graph: A generalized star graph, Inform Proc Lett 56 (1995), 259-264.
11. K. Day and A. Tripathi, Arrangement graphs: A class of generalized star graphs, Inform Proc Lett 42 (1992), 235-241.
12. K. Day and A. Tripathi, Unidirectional star graphs, Inform Proc Lett 45 (1993), 123-129.
13. K. Day and A. Tripathi, A comparative study of topological properties of hypercubes and star graphs, IEEE Trans Parallel Distrib Syst 4 (1994), 31-38.
14. A. Frank (Editor), Connectivity augmentation of networks: Structures and algorithms (Special Issue), Math Prog (Series B) 84 (1999), 439-644.
15. H.N. Gabow and T. Jordán, How to make a square grid framework with cables rigid, SIAM J Comput 30 (2000), 649-680.
16. L. Gargano, U. Vaccaro, and A. Vozella, Fault tolerant routing in the star and pancake interconnection networks, Inform Proc Lett 45 (1993), 315-320.
17. M. Grötschel, C.L. Monma, and M. Stoer, Design of survivable networks, Handbook in operations research and management science, Vol 7, Network models, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), North-Holland, Amsterdam, 1994, pp. 617-672.
18. Q. Gu and S. Peng, An efficient algorithm for k-pairwise disjoint paths in star graphs, Inform Proc Lett 67 (1998), 283-287.
19. Q.-P. Gu and S. Peng, Cluster fault-tolerant routing in star graphs, Networks 35 (2000), 83-90.
20. D.A. Hoelzeman and S. Bettayeb, On the genus of the star graphs, IEEE Trans Comput 43 (1994), 755-759.
21. V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to parallel computing, Benjamin Cummings, Redwood City, CA, 1994.
22. V.E. Mendia and D. Sarkar, Optimal broadcasting on the star graphs, IEEE Trans Parallel Distr Syst 3 (1992), 389-396.
23. X. Shen, Q. Hu, B. Cong, H. Sudborough, M. Girou, and S. Bettayeb, The 4-star graph is not a subgraph of any hypercube, Inform Proc Lett 37 (1993), 199-203.
24. J.P. Sheu, C.Y. Wu, and T.S. Chen, An optimal broadcasting algorithm without message redundancy in star graphs, IEEE Trans Parallel Distr Syst 6 (1995), 653-658.
25. O. Sýkora and I. Vrt'o, On VLSI layouts of the star graph and related networks, Integration VLSI J 17 (1994), 83-93.
26. Y.-C. Tseng, Y.-S. Chen, T.-Y. Juang, and C.-J. Chang, Congestion-free, dilation-2 embedding of complex binary trees into star graphs, Networks 33 (1999), 221-231.
27. Y.C. Tseng and J.P. Sheu, Toward optimal broadcast in a star graph using multiple spanning trees, IEEE Trans Comput 46 (1997), 593-599.
28. C.H. Yen and B. Parhami, VLSI layouts of complete graphs and star graphs, Inform Proc Lett 68 (1998), 39-45.