Drawing a graph in a hypercube

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)1-11
Number of pages11
JournalThe Electronic Journal of Combinatorics
Volume13
Issue number1
Publication statusPublished - 2006
Externally publishedYes

Cite this

@article{89f50e3e3b7742808e8baad5d89ba4e0,
title = "Drawing a graph in a hypercube",
abstract = "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.",
author = "Wood, {David R.}",
year = "2006",
language = "English",
volume = "13",
pages = "1--11",
journal = "The Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Clemson University Digital Press",
number = "1",

}

Drawing a graph in a hypercube. / Wood, David R.

In: The Electronic Journal of Combinatorics, Vol. 13, No. 1, 2006, p. 1-11.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Drawing a graph in a hypercube

AU - Wood, David R.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

M3 - Article

VL - 13

SP - 1

EP - 11

JO - The Electronic Journal of Combinatorics

JF - The Electronic Journal of Combinatorics

SN - 1077-8926

IS - 1

ER -