Path embedding in star graphs

Applied Mathematics and Computation

Volumn 207, Issue 2, 2009, Pages 283-291

  Yang, Ming Chien ^a  

^a ALETHEIA UNIVERSITY   (Taiwan)

Author keywords

Embedding; Hamiltonian; Interconnection network; Path; Star graph

Indexed keywords

HYPERCUBE NETWORKS; INTERCONNECTION NETWORKS;

ARBITRARY VERTICES; DIFFERENT PARTITE SETS; EMBEDDING; ODD LENGTHS; PARTITE SETS; PATH; PATH EMBEDDING; STAR GRAPH;

HAMILTONIANS;

EID: 58349091705     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2008.10.040     Document Type: Article

References (32)

1. S.B. Akers, B. Krishnamurthy, The star graph: an attractive alternative to the n-cube, in: Proceedings of the International Conference on Parallel Processing, 1987, pp. 393-400.
2. Akers S.B., and Krishnamurthy B. A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38 (1989) 555-566
3. Araki T., and Shibata Y. Pancyclicity of recursive circulant graphs. Inform. Process. Lett. 81 4 (2002) 187-190
4. Bae M.M., and Bose B. Edge disjoint hamiltonian cycles in k-ary n-cubes and hypercubes. IEEE Trans. Comput. 52 10 (2003) 1271-1284
5. Birkhoff G., and Maclane S. A Survey of Modern Algebra (1965), MacMillan, New York
6. Chan M.Y., and Lee S.J. Fault-tolerant embedding of complete binary trees in hypercubes. IEEE Trans. Parallel Distrib. Syst. 4 3 (1993) 277-288
7. Chen C.C., and Chen J. Optimal parallel routing in star networks. IEEE Trans. Comput. 46 12 (1997) 1293-1303
8. Fan J., Lin X., and Jia X. Optimal path embedding in crossed cubes. IEEE Trans. Parallel Distrib. Syst. 16 2 (2005) 1190-1200
9. Fan J., Lin X., Pan Y., and Jia X. Optimal fault-tolerant embedding of paths in twisted cubes. J. Parallel Distrib. Comput. 67 2 (2007) 205-214
10. Fragopoulou P., and Akl S.G. Optimal communication algorithms on star graphs using spanning tree constructions. J. Parallel Distrib. Comput. 24 (1995) 55-71
11. Hsieh S.Y., Chen G.H., and Ho C.W. Hamiltonian-laceability of star graphs. Networks 36 4 (2000) 225-232
12. Hsieh S.Y., Chen G.H., and Ho C.W. Longest fault-free paths in star graphs with edge faults. IEEE Trans. Comput. 50 9 (2001) 960-971
13. Hsieh S.Y., Chen G.H., and Ho C.W. Longest fault-free paths in star graphs with vertex faults. Theoret. Comput. Sci. 262 1-2 (2001) 215-227
14. Hsu H.C., Li T.K., Tan J.J.M., and Hsu L.H. Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs. IEEE Trans. Comput. 53 1 (2004) 39-53
15. Hung H.S., Fu J.S., and Chen G.H. Fault-free Hamiltonian cycles in crossed cubes with conditional link faults. Inform. Sci. 177 24 (2007) 5664-5674
16. Jwo J.S., Lakshmivarahan S., and Dhall S.K. Embedding of cycles and grids in star graphs. J. Circuits Syst. Comput. 1 (1991) 43-74
17. Ku S.C., Wang B.F., and Hung T.K. Construction edge-disjoint spanning trees in product networks. IEEE Trans. Parallel Distrib. Syst. 14 3 (2003) 213-221
18. Kulasinghe P., and Bettayeb S. Embedding binary trees into crossed cubes. IEEE Trans. Comput. 44 7 (1995) 923-929
19. Latifi S. On the fault-diameter of the star graph. Inform. Process. Lett. 46 (1993) 143-150
20. Li T.K. Cycle embedding in star graphs with edge faults. Appl. Math. Comput. 167 (2005) 891-900
21. Lin C.K., Huang H.M., Hsu L.H., and Bau S. Mutually independent hamiltonian paths in star networks. Networks 46 2 (2005) 110-117
22. Mendia V.E., and Sarlar D. Optimal broadcasting on the star graph. IEEE Trans. Parallel Distrib. Syst. 3 (1992) 389-396
23. Rouskov Y., Latifi S., and Srimani P.K. Conditional fault diameter of star graph networks. J. Parallel Distrib. Comput. 33 (1996) 91-97
24. Rouskov Y., and Srimani P.K. Fault diameter of star graph networks. Inform. Process. Lett. 48 (1993) 243-251
25. Rowley R.A., and Bose B. Fault-tolerant ring embedding in de-Bruijn networks. IEEE Trans. Comput. 12 (1993) 1480-1486
26. Tseng Y.C., Chang S.H., and Sheu J.P. Fault-tolerant ring embedding in a star graph with both link and node failures. IEEE Trans. Parallel Distrib. Syst. 8 12 (1997) 1185-1195
27. Sheu J.P., Wu C.T., and Chen T.S. An optimal broadcasting algorithm without message redundancy in star graphs. IEEE Trans. Parallel Distrib. Syst. 6 (1995) 653-658
28. Xu J.M., Ma M., and Lü M. Paths in Möbius cubes and crossed cubes. Inform. Process. Lett. 97 3 (2006) 94-97
29. Xu M., Hu X.D., and Zhu Q. Edge-bipancyclicity of star graphs under edge fault-tolerant. Appl. Math. Comput. 183 (2006) 972-979
30. Yang M.C., Tan J.M., and Hsu L.H. Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes. J. Parallel Distrib. Comput. 67 4 (2007) 362-368
31. Yang M.C., Tan J.M., and Hsu L.H. Highly fault-tolerant cycle embeddings of hypercubes. J. Syst. Architect. 53 (2007) 227-232
32. Yang P.J., Tien S.B., and Raghavendra C.S. Embedding of rings and meshes onto faulty hypercubes using free dimensions. IEEE Trans. Comput. 43 5 (1994) 608-613