𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The basis number of the n-cube

✍ Scribed by John Anthony Banks; Edward F Schmeichel

Book ID
107884161
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
286 KB
Volume
33
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bounds for the crossing number of the N-
Bounds for the crossing number of the N-cube
✍ Tom Madej πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 658 KB

## Abstract Let __Q__~__n__~ denote the n‐dimensional hypercube. In this paper we derive upper and lower bounds for the crossing number __v__(__Q__~__n__~), i.e., the minimum number of edge‐crossings in any planar drawing of __Q__~__n__~. The upper bound is close to a result conjectured by Eggleton

On edge numberings of the n-cube graph
On edge numberings of the n-cube graph
✍ Sergei Bezrukov; Norbert GrΓΌnwald; Karl Weber πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 875 KB
Bounds on the number of Hamiltonian circ
Bounds on the number of Hamiltonian circuits in the n-cube
✍ Robert James Douglas πŸ“‚ Article πŸ“… 1977 πŸ› Elsevier Science 🌐 English βš– 224 KB πŸ‘ 1 views

New upper anti lower ~,ounds arc found for the number of HamilI(,nian circuits in the graph of Ihe r -cube. (2) -1 i,, ,,' We show that h(n)~ [n(n -I)/212 .... '~'"""',"' = U~(e,) (3)

Evolution of the n-cube
Evolution of the n-cube
✍ Paul ErdΓΆs; Joel Spencer πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 373 KB
On the chromatic number of cube-like gra
On the chromatic number of cube-like graphs
✍ Charles Payan πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 343 KB

A cube-like graph is a graph whose vertices are all 2" subsets of a set E of cardinality n, in which two vertices are adjacent if their symmetric difference is a member of a given specified collection of subsets of E. Many authors were interested in the chromatic number of such graphs and thought it