System-level fault diagnosis deals with the problem of identifying faulty nodes (processors) in a multiprocessor system. Each node is faulty or fault-free, and it can test other nodes in the system, and outputs the test results. The test result from a node is reliable if the node is fault-free, but the result is unreliable if it is faulty. In this paper, we prove that four variants of the hyper...

Hyper-tubes consisting of hyper-cubes of n-dimensions were designed and formulas for substructures of vary dimensions established.

Stein (1990) discovered (n l)! lattice tilings of R” by translates of the notched n-cube which are inequivalent under translation. We show that there are no other inequivalent tilings of IF!” by translates of the notched cube.

The Fibonacci cube Γn is obtained from the n-cube Qn by removing all the vertices that contain two consecutive 1s. It is proved that Γn admits a perfect code if and only if n ≤ 3.

In this paper, we investigate the fault-tolerant capabilities of the k-ary n-cubes for even integer k with respect to the hamiltonian and hamiltonian-connected properties. The k-ary n-cube is a bipartite graph if and only if k is an even integer. Let F be a faulty set with nodes and/or links, and let k 3 be an odd integer. When |F | 2n−2, we show that there exists a hamiltonian cycle in a wound...

In this research, another version of the star cube called the generalized-star cube, GSC(n, k,m), is presented as a three level interconnection topology. GSC(n, k,m) is a product graph of the (n, k)-star graph and the m-dimensional hypercube (m-cube). It can be constructed in one of two ways: to replace each node in an m-cube with an (n, k)-star graph, or to replace each node in an (n, k)-star ...

1. For each i>0, let 7, denote the closed interval O^x^ 1 and let °I¡ denote the open interval 0<*< 1. Let 7°° =fli>o 7 and °7°° = rii>o °h7°° is the Hilbert cube or parallelotope sometimes denoted by Q. °7°° is homeomorphic to the space sometimes called s, the countable infinite product of lines. The principal theorems of this paper are found in §§5, 7, 8, and 9. In §5 it is shown as a special...

Families of non-lattice tilings of R by unit cubes are constructed. These tilings are specializations of certain families of nonlinear codes over GF( 2 ). These cube-tilings provide building blocks for the construction of cube-tilings such that no two cubes have a high-dimensional face in common. We construct cube-tilings of R such that no two cubes have a common face of dimension exceeding n −...

In a series of papers, I. J. Schoenberg [1 3] studied motions inside an n-dimensional cube with side length one, centered at the origin, of a point particle which moves like a billiard ball, that is, the particle always moves along a straight line until it encounters the boundary of the cube, when it is reflected in the usual way. Only non-trivial motions, that is, ones not contained in any hyp...

It is well known that the k-ary n-cube has been one of the most efficient interconnection networks for distributed-memory parallel systems. A k-ary n-cube is bipartite if and only if k is even. Let (X,Y ) be a bipartition of a k-ary 2-cube (even integer k ≥ 4). In this paper, we prove that for any two healthy vertices u ∈ X, v ∈ Y , there exists a hamiltonian path from u to v in the faulty k-ar...