@article{(Open Science Index):https://publications.waset.org/pdf/791,
	  title     = {An Improved Construction Method for MIHCs on Cycle Composition Networks},
	  author    = {Hsun Su and  Yuan-Kang Shih and  Shin-Shin Kao},
	  country	= {},
	  institution	= {},
	  abstract     = {Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generalized recursive circulant graphs, circulant graphs and so on, are shown to belong to the family of cycle composition networks. Recently, various studies about mutually independent hamiltonian cycles, abbreviated as MIHC-s, on interconnection networks are published. In this paper, using an improved construction method, we obtain MIHC-s on cycle composition networks with a much weaker condition than the known result. In fact, we established the existence of MIHC-s in the cycle composition networks and the result is optimal in the sense that the number of MIHC-s we constructed is maximal.
},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {6},
	  number    = {4},
	  year      = {2012},
	  pages     = {477 - 481},
	  ee        = {https://publications.waset.org/pdf/791},
	  url   	= {https://publications.waset.org/vol/64},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 64, 2012},
	}