Constructing Two Edge-Disjoint Hamiltonian Cycles and Two-Equal Path Cover in Augmented Cubes.docVIP

IAENG International Journal of Computer Science, 39:1, IJCS_39_1_05 ______________________________________________________________________________________ Constructing Two Edge-Disjoint Hamiltonian Cycles and Two-Equal Path Cover in Augmented Cubes Ruo-Wei Hung Abstract—The n-dimensional hypercube network Qn is one of n-dimensional augmented cube is only about half of of the most popular interconnection networks since it has the diameter of n-dimensional hypercube, and augmented simple structure and is easy to implement. The n-dimensional cubes are node-symmetric [7]. Recently, some interesting properties, such as conditional link faults, of the augmented augmented cubeAQ , an important variation of the hypercube, n possesses several embedding properties that hypercubes and cubeAQ have been investigated in the literature. Choudum other variations do not possess. The advantages of AQn that the diameter is only about half of the diameter ofQn are and n and Sunitha [7] provedAQ , withn
2, is pancyclic; that n contains cycles of arbitrary length. Wang et al. [33] it is node-symmetric. Recently, some interesting properties of AQn have been investigated in the literature. The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traf?c to be spread evenly across the is, showed that AQ , with n AQn
4, remains pancyclic provided n faulty vertices and/or edges do not exceed 2n?3. Hsieh and Shiu [13] proved thatAQ is node-pancyclic, in which n interconnection network. A networkG contains two-equal path for every node u and any integer

3, the graph contains cover and is called two-equal path coverable if for any two a cycle of length
such that is in the cycle. Hsu et al. u distinct pairs of nodes
μ ,μ  and
υ ,υ  of G, there exist s t s t [16] proved