Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

COMBINATORICS
2006

favoriteEmaildiscussreport

135views more COMBINATORICS 2006»

Drawing a Graph in a Hypercube

13 years 4 months ago

Drawing a Graph in a Hypercube

Download www.combinatorics.org

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.

David R. Wood

Real-time Traffic

COMBINATORICS 2006 | D-dimensional Hypercube | Distinct Points | Upper Bounds |

claim paper

Related Content

» On the genus of pancake network

» Layout Volumes of the Hypercube

» A New ForceDirected Graph Drawing Method Based on EdgeEdge Repulsion

» Distance Labelling Problems for Hypercubes and Hamming Graphs A Survey

» Direct Product Factorization of Bipartite Graphs with Bipartitionreversing Involutions

» A Class of HypercubeLike Networks

» On embedding complete graphs into hypercubes

» Embeddings into the Pancake Interconnection Network

» Searching for SnakeInTheBox Codes With Evolved Pruning Models

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	COMBINATORICS
Authors	David R. Wood

Comments (0)