Mutually independent hamiltonian paths in star networks

Networks

Volumn 46, Issue 2, 2005, Pages 110-117

  Lin, Cheng Kuan ^a   Huang, Hua Min ^a   Hsu, Lih Hsing ^b   Bau, Sheng ^c  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b TA HWA INSTITUTE OF TECHNOLOGY   (Taiwan)

^c UNIVERSITY OF KWAZULU NATAL   (South Africa)

Author keywords

Hamiltonian; Hamiltonian connected; Hamiltonian laceable; Interconnection networks; Star networks

Indexed keywords

HAMILTONIANS; INTERCONNECTION NETWORKS; SET THEORY;

HAMILTONIAN CONNECTED; HAMILTONIAN LACEABLE; STAR NETWORKS;

GRAPH THEORY;

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

References (15)

1. S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Trans Comput 38 (1989), 555-566.
2. N. Bagherzadeh, M. Dowd, and N. Nassif, Embedding an arbitrary tree into the star graph, IEEE Trans Comput 45 (1996), 475-181.
3. J.A. Bondy and U.S.R. Murty, Graph theory with applications, North Holland, New York, 1980.
4. A. Bouabdallah, M.C. Heydemann, J. Opatrny, and D. Sotteau, Embedding complete binary trees into star and pancake graphs, Theory Comput Syst 31 (1998), 279-305.
5. 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.
6. P. Fragopoulou and S.G. Akl, Optimal communication algorithms on the star graphs using spanning tree constructions, J Parallel Distrib Comput 23 (1995), 55-71.
7. P. Fragopoulou and S.G. Akl, Edge-disjoint spanning trees on the star networks with applications to fault tolerance, IEEE Trans Comput 45 (1996), 174-185.
8. S. Y. Hsieh, G.H. Chen, and C. W. Ho, Hamiltonian-laceability of star graphs, Networks 36 (2000), 225-232.
9. 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.
10. S. Latifi, On the fault-diameter of the star graph, Informat Process Lett 46 (1993), 143-150.
11. F.T. Leighton, Introduction to parallel algorithms and architectures: Arrays middot; trees · hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
12. 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.
13. Y. Rouskov, S. Latifi, and P.K. Srimani, Conditional fault diameter of star graph networks, J Parallel Distrib Comput 33 (1996), 91-97.
14. Y. Rouskov and P.K. Srimani, Fault diameter of star graph networks, Informat Process Lett 48 (1993), 243-251.
15. 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.