
arXiv: math/0509455
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.
Graph representations (geometric and intersection representations, etc.), hypercube drawing, Planar graphs; geometric and topological aspects of graph theory, Graph labelling (graceful graphs, bandwidth, etc.), antimagic injections, Graph theory (including graph drawing) in computer science, Special sequences and polynomials, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Sidon sets
Graph representations (geometric and intersection representations, etc.), hypercube drawing, Planar graphs; geometric and topological aspects of graph theory, Graph labelling (graceful graphs, bandwidth, etc.), antimagic injections, Graph theory (including graph drawing) in computer science, Special sequences and polynomials, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Sidon sets
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
