✦ LIBER ✦

On edge numberings of the n-cube graph

✍ Scribed by Sergei Bezrukov; Norbert Grünwald; Karl Weber

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 875 KB
Volume: 46
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90023-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Maximum number of edges joining vertices

Maximum number of edges joining vertices on a cube

✍ Khaled A.S. Abdel-Ghaffar 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 84 KB

Let E d (n) be the number of edges joining vertices from a set of n vertices on a d-dimensional cube, maximized over all such sets. We show that E d (n) = r-1 i=0 (l i /2 + i)2 l i , where r and l 0 > l 1 > • • • > l r-1 are nonnegative integers defined by n = r-1 i=0 2 l i .

A note on the edges of the n-cube

✍ Sergiu Hart 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 671 KB

The following combinatorial problem, which arose in game theory, is solved here: To tind a selt of vertices of ;P given size (in t.k nxube) which has a maximal number sf interconnecting edges,

Edge domatic numbers of complete n- part

Edge domatic numbers of complete n- partite graphs

✍ Shiow-Fen Hwang; Gerard J. Chang 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 575 KB

Hamiltonian properties of the cube of a

Hamiltonian properties of the cube of a 2-edge connected graph

✍ M. Paoli 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 514 KB

Let G be a 2-edge connected graph with a t least 5 vertices. For any given vertices a, b, c, and din G with a # b, there exists in G3 a hamiltonian path with endpoints a and b avoiding the edge cd, and there exists in G3 U {cd} a hamiltonian path with endpoints a and b and containing the edge cd. Al

On the Number of Edges of Quadrilateral-

On the Number of Edges of Quadrilateral-Free Graphs

✍ Zoltán Füredi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 247 KB

If a graph has q 2 +q+1 vertices (q>13), e edges and no 4-cycles then e 1 2 q(q+1) 2 . Equality holds for graphs obtained from finite projective planes with polarities. This partly answers a question of Erdo s from the 1930's. 1996 Academic Press, Inc. ## 1. Results Let f (n) denote the maximum n