Hamiltonian-laceability of star graphs

Networks

Volumn 36, Issue 4, 2000, Pages 225-232

  Hsieh, Sun Yuan ^a   Chen, Gen Huey ^b   Ho, Chin Wen ^c  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

Bipartite graph; Hamiltonian path; Hamiltonian laceability; Longest path; Star graph

Indexed keywords

EID: 0034393290     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200012)36:4<225::AID-NET3>3.0.CO;2-G     Document Type: Article

References (27)

1. [1] S.B. Akers, D. Harel, and B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, Proc Int Conf Parallel Processing, 1986, pp. 216-223.
2. [2] S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans Comput 38 (1989), 555-566.
3. [3] S.G. Akl, Parallel computation: Models and methods, Prentice-Hall, Englewood Cliffs, NJ, 1997.
4. [4] N. Bagherzadeh, M. Dowd, and N. Nassif, Embedding an arbitrary tree into the star graph, IEEE Trans Comput 45 (1996), 475-481.
5. [5] P. Berthome, A. Ferreira, and S. Perennes, Optimal information dissemination in star and pancake networks, IEEE Trans Parallel Distrib Syst 7 (1996), 1292-1300.
6. [6] F. Buckley and F. Harary, Distance in graphs, Addison-Wesley, Reading, MA, 1989.
7. [7] C.T. Chen, Y.C. Tseng, and S.P. Sheu, Balanced spanning trees in complete and incomplete star graphs, IEEE Trans Parallel Distrib Syst 7 (1996), 717-723.
8. [8] K. Day and A. Tripathi, A comparative study of topological properties of hypercubes and star graphs, IEEE Trans Parallel Distrib Syst 5 (1994), 31-38.
9. [9] M. Dietzfelbinger, S. Madhavapeddy, and I.H. Sudborough, Three disjoint path paradigms in star networks, Proc 3rd IEEE Symp Parallel and Distributed Processing, 1991, pp. 400-406.
10. [10] P. Fragopoulou and S.G. Akl, A parallel algorithm for computing Fourier transforms on the star graph, IEEE Trans Parallel Distrib Syst 5 (1994), 525-531.
11. [11] P. Fragopoulou and S.G. Akl, Optimal communication algorithms on star graphs using spanning tree constructions, J Parallel Distrib Comput 24 (1995), 55-71.
12. [12] M.C. Heydemann, J. Opatrny, and D. Sotteau, Embeddings of computer binary trees into star graphs with congestion 1, Proc 28th Ann Hawaii Int Conf System Sciences, 1995, pp. 546-554.
13. [13] J.S. Jwo, S. Lakshmivarahan, and S.K. Dhall, Embedding of cycles and grids in star graphs, J Circuits Syst Comput 1 (1991), 43-74.
14. [14] S. Latifi, On the fault-diameter of the star graph. Info Process Lett 46 (1993), 143-150.
15. [15] A. Mann and A.K. Somani, An efficient sorting algorithm for the star graph interconnection network, Proc Int Conf Parallel Processing, Vol. III, 1990, pp. 1-8.
16. [16] V.E. Mendia and D. Sarkar, Optimal broadcasting on the star graph, IEEE Trans Parallel Distrib Syst 3 (1992), 389-396.
17. [17] Z. Miller, D. Pritikin, and I.H. Sudborough, Near embeddings of hypercubes into Cayley graphs on the symmetric group, IEEE Trans Comput 43 (1994), 13-22.
18. [18] K. Qiu and S.G. Akl, Load balancing and selection on the star and pancake interconnection networks. Proc 26th Ann Hawaii Int Conf System Sciences, 1993, pp. 235-242.
19. [19] K. Qiu, S.G. Akl, and H. Meijer, On some properties and algorithms for the star and pancake interconnection networks, J Parallel Distrib Comput 12 (1994), 16-25.
20. [20] K. Qiu, S.G. Akl, and I. Stojmenovic, Data communication and computational geometry on the star and pancake networks, Proc IEEE Symp Parallel Distributed Processing, 1991, pp. 415-422.
21. [21] S. Ranka, J.C. Wang, and N. Yeh, Embedding meshes on the star graph, J Parallel Distrib Comput 19 (1993), 131-135.
22. [22] Y. Rouskov, S. Latifi, and P.K. Srimani, Conditional fault diameter of star graph networks, J Parallel Distrib Comput 33 (1996), 91-97.
23. [23] Y. Rouskov and P.K. Srimani, Fault diameter of star graphs, Info Process Lett 48 (1993), 243-251.
24. [24] D.K. Saikia and R.K. Sen, Two ranking schemes for efficient computation on the star interconnection network, IEEE Trans Parallel Distrib Syst 7 (1996), 321-327.
25. [25] J.P. Sheu, C.T. Wu, and T.S. Chen, An optimal broadcasting algorithm without message redundancy in star graphs, IEEE Trans Parallel Distrib Syst 6 (1995), 653-658.
26. [26] Y.C. Tseng, S.H. Chang, and J.P. Sheu, Fault-tolerant ring embedding in a star graph with both link and node failures, IEEE Trans Parallel Distrib Syst 8 (1997), 1185-1195.
27. [27] S.A. Wong, Hamilton cycles and paths in butterfly graphs, Networks 26 (1995), 145-150.