Drawing a graph in a hypercube (Q2500992): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0509455 / rank | |||
Normal rank | |||
Latest revision as of 06:55, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
