Mathematics – Combinatorics
Scientific paper
2010-01-02
Mathematics
Combinatorics
14 pages, 3 figures
Scientific paper
In this note we study and compare three graph invariants related to the 'compactness' of graph drawing in the plane: the dilation coefficient, defined as the smallest possible quotient between the longest and the shortest edge length; the plane-width, which is the smallest possible quotient between the largest distance between any two points and the shortest length of an edge; and the resolution coefficient, the smallest possible quotient between the longest edge length and the smallest distance between any two points. These three invariants coincide for complete graphs. We show that graphs with large dilation coefficient or plane-width have a vertex with large valence but there exist cubic graphs with arbitrarily large resolution coefficient. Surprisingly enough, the one-dimensional analogues of these three invariants allow us to revisit the three well known graph parameters: the circular chromatic number, the chromatic number, and the bandwidth. We also examine the connection between bounded resolution coefficient and minor-closed graph classes.
Milanic Martin
Pisanski Tomaz
Zitnik Arjana
No associations
LandOfFree
A note on dilation coefficient, plane-width, and resolution coefficient of graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A note on dilation coefficient, plane-width, and resolution coefficient of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on dilation coefficient, plane-width, and resolution coefficient of graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-222595