Results 261 to 270 of about 15,366,710 (301)

Improved Upper Bounds for Identifying Codes in n-dimensional q-ary Cubes

International Journal of Applied and Computational Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
N. V. Shinde, B. N. Waphare
openaire   +2 more sources

The face lattice of ann-dimensional cube

Algebra Universalis, 1982
We give necessary and sufficient conditions on a latticeL which guarantee its being the lattice of faces of then-dimensional cube.
openaire   +1 more source

SMALL-WORLD AND SCALE-FREE PROPERTIES OF THE n-DIMENSIONAL SIERPINSKI CUBE NETWORKS

Fractals, 2020
In this paper, we construct evolving networks from [Formula: see text]-dimensional Sierpinski cube. Using the self-similarity of Sierpinski cube, we show the evolving networks have scale-free and small-world properties.
CHENG ZENG, MENG ZHOU, YUMEI XUE
openaire   +1 more source

Hyperplane Sections of the n -Dimensional Cube

The American Mathematical Monthly, 2012
We deduce an elementary formula for the volume of arbitrary hyperplane sections of the n-dimensional cube and show its application in various dimensions.
Rolfdieter Frank, Harald Riede
openaire   +1 more source

An Upper Bound for the Length of a Snake in the n-Dimensional Unit Cube

1997
The \(n\)-dimensional unit cube is a graph whose vertex set is the set of all \(n\)-dimensional Boolean vectors and in which two vertices are adjacent if and only if they differ in exactly one coordinate. A snake in such a graph is the longest induced circuit (i.e. without diagonal edges).
openaire   +2 more sources

On orientation-preserving automorphisms of Hamiltonian cycles in the N-dimensional Boolean cube

Journal of Applied and Industrial Mathematics, 2011
Summary: We obtain an upper bound for the order of the group of orientation-preserving automorphisms of a Hamiltonian cycle in the Boolean \(n\)-cube. We prove that the existence of a Hamiltonian cycle with the order of the group of orientation-preserving automorphisms attaining this upper bound is equivalent to the existence of a Hamiltonian cycle ...
openaire   +2 more sources

The h-Faulty-Block Connectivity of n-Dimensional Locally Twisted Cube

Journal of Interconnection Networks
The connectivity of a network is an important indicator for assessing its reliability and fault-tolerability. In this paper, we study a novel measure, which is [Formula: see text]-faulty-block connectivity. Given a connected graph [Formula: see text] and a non-negative integer [Formula: see text], let [Formula: see text] and [Formula: see text] be ...
Xiaohui Hua, Qin Zhao
openaire   +2 more sources

Some inequalities connected with subsets of layers of the unit n-dimensional cube

USSR Computational Mathematics and Mathematical Physics, 1982
Translation from Zh. Vychisl. Mat. Mat. Fiz. 22, 1012-1025 (Russian) (1982; Zbl 0511.05005).
openaire   +2 more sources

Orthogonal vectors in then-dimensional cube and codes with missing distances

Combinatorica, 1986
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On a continuous n-dimensional Rubik’s cube without 2-dimensional symmetries

Monatshefte für Mathematik
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources