In this paper we study the symmetry parameters determining number, distinguishing and cost of 2-distinguishing, for some variations on hypercubes, namely Hamming graphs, powers folded enhanced augmented hypercubes locally twisted hypercubes.

In this paper, we present that a tree machine can be embedded into incomplete hypercube with expansion 1, load 1, dilation 2 and congestion 2. This result is better than the expansion (2+2)/(2+2-2) in [14]. Then we consider how to embed a large tree machine into a hypercube for considering load-balance. We have shown that a tree machine TMh (h1) can be embedded into a hypercube Hh+1 with dilat...

A new, efficient algorithm for blind separation of uniformly distributed sources is proposed. The mixing matrix is assumed to be orthogonal by prewhitening the observed signals. The learning rule adaptively estimates the mixing matrix by conceptually rotating a unit hypercube so that all output signal components are contained within or on the hypercube. Under some ideal constraints, it has been...

The enhanced hypercube Qn,k is a variant of the hypercube Qn. We investigate all the lengths of cycles that an edge of the enhanced hypercube lies on. It is proved that every edge of Qn,k lies on a cycle of every even length from 4 to 2; if k is even, every edge of Qn,k also lies on a cycle of every odd length from k+3 to 2 − 1, and some special edges lie on a shortest odd cycle of length k + 1.