Cubicity, boxicity, and vertex cover |
| |
Authors: | L Sunil Chandran Anita Das |
| |
Institution: | Computer Science and Automation Department, Indian Institute of Science, Bangalore-560012, India |
| |
Abstract: | A k-dimensional box is the cartesian product R1×R2×?×Rk where each Ri is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G is the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the cartesian product R1×R2×?×Rk where each Ri is a closed interval on the real line of the form ai,ai+1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. In this paper we show that cub(G)≤t+⌈log(n−t)⌉−1 and , where t is the cardinality of a minimum vertex cover of G and n is the number of vertices of G. We also show the tightness of these upper bounds.F.S. Roberts in his pioneering paper on boxicity and cubicity had shown that for a graph G, and , where n is the number of vertices of G, and these bounds are tight. We show that if G is a bipartite graph then and this bound is tight. We also show that if G is a bipartite graph then . We point out that there exist graphs of very high boxicity but with very low chromatic number. For example there exist bipartite (i.e., 2 colorable) graphs with boxicity equal to . Interestingly, if boxicity is very close to , then chromatic number also has to be very high. In particular, we show that if , s≥0, then , where χ(G) is the chromatic number of G. |
| |
Keywords: | Boxicity Cubicity Vertex cover |
本文献已被 ScienceDirect 等数据库收录! |
|