標題: Mutually independent hamiltonian cycles for the pancake graphs and the star graphs 作者: Lin, Cheng-KuanTan, Jimmy J. M.Huang, Hua-MinHsu, D. FrankHsu, Lih-Hsing資訊工程學系Department of Computer Science 關鍵字: Hamiltonian;Pancake networks;Star networks 公開日期: 6-Sep-2009 摘要: A hamiltonian cycle C of a graph G is an ordered set < u(1), u(2,) ..., u(n(G)), u(1)> of vertices such that u(i) not equal u(j) for i not equal j and u(i) is adjacent to u(i+1) for every i is an element of {1, 2, ..., n(G) - 1} and u(n(G)) is adjacent to u(1), where n(G) is the order of G. The vertex u(1) is the starting vertex and u(i) is the ith vertex of C. Two hamiltonian cycles C(1) = < u(1), u(2), ..., u(n(G)), u(1)> and C(2) = < v(1), v(2), ..., v(n(G)), v(1)> of G are independent if u(1) = v(1) and u(i) not equal v(i) for every i is an element of {2, 3, ..., n(G)}. A set of hamiltonian cycles {C(1), C(2), ..., C(k)} of G is mutually independent if its elements are pairwise independent. The mutually independent hamiltonicity IHC(G) of a graph G is the maximum integer k such that for any vertex u of G there exist k mutually independent hamiltonian cycles of G starting at u. In this paper, the mutually independent hamiltonicity is considered for two families of Cayley graphs, the n-dimensional pancake graphs P(n) and the n-dimensional star graphs S(n). It is proven that IHC(P(3)) = 1, IHC(P(n)) = n - 1 if n >= 4, IHC(S(n)) = n - 2 if n is an element of {3, 4} and IHC(S(n)) = n - 1 if n >= 5. (C) 2009 Elsevier B.V. All rights reserved. URI: http://dx.doi.org/10.1016/j.disc.2008.12.023http://hdl.handle.net/11536/6687 ISSN: 0012-365X DOI: 10.1016/j.disc.2008.12.023 期刊: DISCRETE MATHEMATICS Volume: 309 Issue: 17 起始頁: 5474 結束頁: 5483 Appears in Collections: Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.