Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1×I2×···×Ib, where each Ii is a closed interval of unit length on the real line. The cubicity of G, denoted by cub(G), is the minimum positive integer b such that the vertices in G can be mapped to axis parallel b-dimensional cubes in such a way that two vertices are adjacent in G if and only if their assigned cubes intersect. An interval graph is a graph that can be represented as the intersection of intervals on the real line—i.e. the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. Suppose S(m) denotes a star graph on m+1 nodes. We define claw number ψ(G) of the graph to be the largest positive integer m such that S(m) is an induced subgraph of G. It can be easily shown that the cubicity of any graph is at least ⌈log2ψ(G)⌉. In this article, we show that for an interval graph G ⌈log2ψ(G)⌉lcub(G)l⌈log2ψ(G)⌉+2. It is not clear whether the upper bound of ⌈log2ψ(G)⌉+2 is tight: till now we are unable to find any interval graph with cub(G)>⌈log2ψ(G)⌉. We also show that for an interval graph G, cub(G)l⌈log2α⌉, where α is the independence number of G. Therefore, in the special case of ψ(G)=α, cub(G) is exactly ⌈log2α2⌉. The concept of cubicity can be generalized by considering boxes instead of cubes. A b-dimensional box is a Cartesian product I1×I2×···×Ib, where each Ii is a closed interval on the real line. The boxicity of a graph, denoted box(G), is the minimum k such that G is the intersection graph of k-dimensional boxes. It is clear that box(G)lcub(G). From the above result, it follows that for any graph G, cub(G)lbox(G)⌈log2α⌉. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 323–333, 2010
[1]
Carsten Thomassen,et al.
Interval representations of planar graphs
,
1986,
J. Comb. Theory, Ser. B.
[2]
Peter C. Fishburn.
On the sphericity and cubicity of graphs
,
1983,
J. Comb. Theory, Ser. B.
[3]
T. S. Michael,et al.
Sphericity, cubicity, and edge clique covers of graphs
,
2006,
Discret. Appl. Math..
[4]
Takao Asano,et al.
Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane
,
1983,
J. Algorithms.
[5]
William T. Trotter.
A characterization of robert's inequality for boxicity
,
1979,
Discret. Math..
[6]
Naveen Sivadasan,et al.
Boxicity and maximum degree
,
2008,
J. Comb. Theory, Ser. B.
[7]
Fred S. Roberts,et al.
Computing the boxicity of a graph by covering its complement by cointerval graphs
,
1983,
Discret. Appl. Math..
[8]
Naveen Sivadasan,et al.
On the Cubicity of Interval Graphs
,
2007,
Graphs Comb..
[9]
Alexandr V. Kostochka,et al.
Coloring intersection graphs of geometric figures with a given clique number
,
2004
.
[10]
Naveen Sivadasan,et al.
The cubicity of hypercube graphs
,
2008,
Discret. Math..
[11]
L. Sunil Chandran,et al.
An upper bound for Cubicity in terms of Boxicity
,
2009,
Discret. Math..
[12]
Robert J. Fowler,et al.
Optimal Packing and Covering in the Plane are NP-Complete
,
1981,
Inf. Process. Lett..
[13]
Naveen Sivadasan,et al.
Boxicity and treewidth
,
2007,
J. Comb. Theory, Ser. B.
[14]
M. Yannakakis.
The Complexity of the Partial Order Dimension Problem
,
1982
.
[15]
Abhijin Adiga,et al.
Cubicity of threshold graphs
,
2009,
Discret. Math..
[16]
Jan Kratochvíl.
A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness
,
1994,
Discret. Appl. Math..