Drawing a graph in a hypercube (Q2500992)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Drawing a graph in a hypercube |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Drawing a graph in a hypercube |
scientific article |
Statements
Drawing a graph in a hypercube (English)
0 references
30 August 2006
0 references
Summary: A \(d\)-dimensional hypercube drawing of a graph represents the vertices by distinct points in \(\{0,1\}^d\), such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions in hypercube drawing of a given graph. This parameter turns out to be related to Sidon sets and antimagic injections.
0 references
hypercube drawing
0 references
Sidon sets
0 references
antimagic injections
0 references
0.7730599045753479
0 references
0.7530255913734436
0 references
0.7474793791770935
0 references
0.7353475093841553
0 references
0.7276809811592102
0 references
