✦ LIBER ✦

On shifting sets in the binary hypercube

✍ Scribed by Yu. L. Vasil’ev; S. V. Avgustinovich; D. S. Krotov

Book ID: 111471233
Publisher: Pleiades Publishing
Year: 2009
Tongue: English
Weight: 520 KB
Volume: 3
Category: Article
ISSN: 1990-4789
DOI: 10.1134/s199047890902015x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the size of identifying codes in bina

On the size of identifying codes in binary hypercubes

✍ Svante Janson; Tero Laihonen 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Embedding All Binary Trees in the Hyperc

Embedding All Binary Trees in the Hypercube

✍ A.S. Wagner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 923 KB

Optimal visibility algorithms for binary

Optimal visibility algorithms for binary images on the hypercube

✍ Frank Dehne; Quoc T. Pham; Ivan Stojmenović 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 596 KB

Classification of the Hamiltonian Cycles

Classification of the Hamiltonian Cycles in Binary Hypercubes

✍ P.P. Parkhomenko 📂 Article 📅 2001 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 157 KB

Short Dominating Paths and Cycles in the

Short Dominating Paths and Cycles in the Binary Hypercube

✍ Uri Blass; Iiro Honkala; Mark G. Karpovsky; Simon Litsyn 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 92 KB

On defining sets of vertices of the hype

On defining sets of vertices of the hypercube by linear inequalities

✍ R.G. Jeroslow 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 708 KB

This paper skws that for any su Dset S of vertices of the m-dimensional hypercube, L!!d(S) G P-1 \* ~%e.-e ind(SS is the rtMxnwm number of tinear inequz!ities needed to define S. I:'urthermare, for any k in the range 1 c k r? 2n-1, there is an S with ind(S) = k, with the defining inequalities taken