Learn More
As an enhancement on the hypercube Qn, the augmented cube AQn, proposed by Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks, 40(2) (2002), 71–84], not only retains some of the favorable properties of Qn but also possesses some embedding properties that Qn does not. For example, AQn contains cycles of all lengths from 3 to 2, but Qn(More)
Exchanged hypercubes [Loh et al., IEEE Transactions on Parallel and Distributed Systems 16 (2005) 866–874] are spanning subgraphs of hypercubes with about one half of their edges but still with many desirable properties of hypercubes. Lower and upper bounds on the domination number of exchanged hypercubes are proved which in particular imply that γ(EH(2,(More)
The locally twisted cube LTQn which is a newly introduced interconnection network for parallel computing is a variant of the hypercube Qn . Yang et al. [X. Yang, G.M. Megson, D.J. Evans, Locally twisted cubes are 4-pancyclic, Applied Mathematics Letters 17 (2004) 919–925] proved that LTQn is Hamiltonian connected and contains a cycle of length from 4 to 2 n(More)
As an enhancement on the hypercube Qn, the augmented cube AQn, prosed by Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2) (2002) 71–84], not only retains some favorable properties of Qn but also possesses some embedding properties that Qn does not. For example, AQn is pancyclic, that is, AQn contains cycles of arbitrary length(More)
Exchanged hypercubes (Loh et al. in IEEE Trans Parallel Distrib Syst 16:866–874, 2005) are spanning subgraphs of hypercubes with about one half of their edges but still with many desirable properties of hypercubes. In this paper, it is shown that distance properties of exchanged hypercubes are also comparable to the corresponding properties of hypercubes.(More)
This work investigates important properties related to cycles of embedding into the folded hypercube FQn for n ≥ 2. The authors observe that FQn is bipartite if and only if n is odd, and show that the minimum length of odd cycles is n + 1 if n is even. The authors further show that every edge of FQn lies on a cycle of every even length from 4 to 2n; if n is(More)