WASET
	@article{(Open Science Index):https://publications.waset.org/pdf/14050,
	  title     = {Mutually Independent Hamiltonian Cycles of Cn x Cn},
	  author    = {Kai-Siou Wu and  Justie Su-Tzu Juan},
	  country	= {},
	  institution	= {},
	  abstract     = {In a graph G, a cycle is Hamiltonian cycle if it contain all vertices of G. Two Hamiltonian cycles C_1 = ⟨u_0, u_1, u_2, ..., u_n−1, u_0⟩ and C_2 = ⟨v_0, v_1, v_2, ..., v_n−1, v_0⟩ in G are independent if u_0 = v_0, u_i = ΜΈ v_i for all 1 ≤ i ≤ n−1. In G, a set of Hamiltonian cycles C = C_1, C_2, ..., C_k is mutually independent if any two Hamiltonian cycles of C are independent. The mutually independent Hamiltonicity IHC(G), = k means there exist a maximum integer k such that there exists k-mutually independent Hamiltonian cycles start from any vertex of G. In this paper, we prove that IHC(C_n × C_n) = 4, for n ≥ 3.
},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {6},
	  number    = {5},
	  year      = {2012},
	  pages     = {573 - 579},
	  ee        = {https://publications.waset.org/pdf/14050},
	  url   	= {https://publications.waset.org/vol/65},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 65, 2012},
	}