Title of article
The convex dimension of a graph Original Research Article
Author/Authors
Nir Halman، نويسنده , , Shmuel Onn، نويسنده , , Uriel G. Rothblum، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
11
From page
1373
To page
1383
Abstract
The convex dimension of a graph image is the smallest dimension image for which image admits an injective map image of its vertices into image-space, such that the barycenters of the images of the edges of image are in convex position. The strong convex dimension of image is the smallest image for which image admits a map as above such that the images of the vertices of image are also in convex position. In this paper we study the convex and strong convex dimensions of graphs.
Keywords
Discrete geometry , Convex combinatorial optimization , Graph embedding
Journal title
Discrete Applied Mathematics
Serial Year
2007
Journal title
Discrete Applied Mathematics
Record number
886511
Link To Document