Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes

An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.

The design and synthesis of redox core-alpha amino acid composites based on thiol-disulfide exchange mechanism and a comparative study of their zinc abstraction potential from [CCXX] boxes in proteins

The design and synthesis of agents that can abstract zinc from their [CCXX] (C=cysteine; X=cysteine/histidine) boxes by thioldisulfide exchange-having as control, the redox parities of the core sulfur ligands of the reagent and the enzyme, has been illustrated, and their efficiency demonstrated by monitoring the inhibition of the transcription of calf thymus DNA by E. coli RNA polymerase, which harbors two zinc atoms in their [CCXX] boxes of which one is exchangeable. Maximum inhibition possible with removal of the exchangeable zinc was seen with redox-sulfanilamide-glutamate composite. In sharp contrast, normal chelating agents (EDTA, phenanthroline) even in a thousand fold excess showed only marginal inhibition, thus supporting an exchange mechanism for the metal removal. (C) 2002 Elsevier Science Ltd. All rights reserved.

Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions

We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if their corresponding vertices are adjacent. In fact, we construct a representation in which any two intersecting boxes just touch at their boundaries. Further, this construction can be realized in linear time.

On piercing (pseudo)lines and boxes

We say a family of geometric objects C has (l;k)-property if every subfamily C0C of cardinality at most lisk- piercable. In this paper we investigate the existence of g(k;d)such that if any family of objects C in Rd has the (g(k;d);k)-property, then C is k-piercable. Danzer and Gr̈ unbaum showed that g(k;d)is infinite for fami-lies of boxes and translates of centrally symmetric convex hexagons. In this paper we show that any family of pseudo-lines(lines) with (k2+k+ 1;k)-property is k-piercable and extend this result to certain families of objects with discrete intersections. This is the first positive result for arbitrary k for a general family of objects. We also pose a relaxed ver-sion of the above question and show that any family of boxes in Rd with (k2d;k)-property is 2dk- piercable.

REPRESENTING A CUBIC GRAPH AS THE INTERSECTION GRAPH OF AXIS-PARALLEL BOXES IN THREE DIMENSIONS

We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if their corresponding vertices are adjacent. In fact, we construct a representation in which any two intersecting boxes touch just at their boundaries.

An upper bound for Cubicity in terms of Boxicity

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), b(i)] on the real line. The boxicity of any graph G, box(G) is the minimum positive integer b such that G can be represented as the intersection graph of axis-parallel b-dimensional boxes. A b-dimensional cube is a Cartesian product R-1 x R-2 x ... x R-b, where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), a(i) + 1] on the real line. When the boxes are restricted to be axis-parallel cubes in b-dimension, the minimum dimension b required to represent the graph is called the cubicity of the graph (denoted by cub(G)). In this paper we prove that cub(G) <= inverted right perpendicularlog(2) ninverted left perpendicular box(G), where n is the number of vertices in the graph. We also show that this upper bound is tight.Some immediate consequences of the above result are listed below: 1. Planar graphs have cubicity at most 3inverted right perpendicularlog(2) ninvereted left perpendicular.2. Outer planar graphs have cubicity at most 2inverted right perpendicularlog(2) ninverted left perpendicular.3. Any graph of treewidth tw has cubicity at most (tw + 2) inverted right perpendicularlog(2) ninverted left perpendicular. Thus, chordal graphs have cubicity at most (omega + 1) inverted right erpendicularlog(2) ninverted left perpendicular and circular arc graphs have cubicity at most (2 omega + 1)inverted right perpendicularlog(2) ninverted left perpendicular, where omega is the clique number.

Cubicity, boxicity, and vertex cover

A k-dimensional box is the cartesian product R-1 x R-2 x ... x R-k where each R-i 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 R-1 x R-2 x ... x R-k where each Ri is a closed interval on the real line of the form [a(i), a(i) + 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 + inverted right perpendicularlog(n - t)inverted left perpendicular - 1 and box(G) <= left perpendiculart/2right perpendicular + 1, 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, box(G) <= left perpendicularn/2right perpendicular and cub(G) <= inverted right perpendicular2n/3inverted left perpendicular, where n is the number of vertices of G, and these bounds are tight. We show that if G is a bipartite graph then box(G) <= inverted right perpendicularn/4inverted left perpendicular and this bound is tight. We also show that if G is a bipartite graph then cub(G) <= n/2 + inverted right perpendicularlog n inverted left perpendicular - 1. 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 n/4. Interestingly, if boxicity is very close to n/2, then chromatic number also has to be very high. In particular, we show that if box(G) = n/2 - s, s >= 0, then chi (G) >= n/2s+2, where chi (G) is the chromatic number of G.

Boxicity of Halin graphs

A k-dimensional box is the Cartesian product R-1 x R-2 x ... x R-k where each R-i 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. Halin graphs are the graphs formed by taking a tree with no degree 2 vertex and then connecting its leaves to form a cycle in such a way that the graph has a planar embedding. We prove that if G is a Halin graph that is not isomorphic to K-4, then box(G) = 2. In fact, we prove the stronger result that if G is a planar graph formed by connecting the leaves of any tree in a simple cycle, then box(G) = 2 unless G is isomorphic to K4 (in which case its boxicity is 1).

Middle aged wasps mate through most of the year, without regard to body size, ovarian development and nestmateship: a laboratory study of the primitively eusocial wasp Ropalidia marginata

We studied the mating behaviour of the primi-tively eusocial wasp Ropalidia marginata and the factors that may influence sperm transfer. By introducing a male and a female R. marginata into ventilated transparent plastic boxes, we were able to observe mating behaviour, and it involved mounting and short or long conjugation of the wasps. Dissection of female wasps after the observation indicated that long conjugation is a good behavioural predictor of sperm transfer. This finding makes it possible to obtain mated females without dissecting them every time. We tested the effect of age, season, relatedness, body size and female's ovarian status on mating. Under laboratory conditions, mating success declined rapidly below and above the ages 5-20 days. Within this age range mating success was significantly low in December compared to other months tested. There was no nestmate discrimination, and there was no influence of male and female body size or of the ovarian state of the female on the probability of sperm transfer.

Boxicity and maximum degree

A d-dimensional box is a Cartesian product of d closed intervals on the real line. The boxicity of a graph is the minimum dimension d such that it is representable as the intersection graph of d-dimensional boxes. We give a short constructive proof that every graph with maximum degree D has boxicity at most 2D2. We also conjecture that the best upper bound is linear in D.

Characterization of the human SLC22A18 gene promoter and its regulation by the transcription factor Sp1

SLC22A18, a poly-specific organic cation transporter, is paternally imprinted in humans and mice. It shows loss-of-heterozygosity in childhood and adult tumors, and gain-of-imprinting in hepatocarcinomas and breast cancers. Despite the importance of this gene, its transcriptional regulation has not been studied, and the promoter has not yet been characterized. We therefore set out to identify the potential cis-regulatory elements including the promoter of this gene. The luciferase reporter assay in human cells indicated that a region from -120 by to +78 by is required for the core promoter activity. No consensus TATA or CHAT boxes were found in this region, but two Sp1 binding sites were conserved in human, chimpanzee, mouse and rat. Mutational analysis of the two Sp1 sites suggested their requirement for the promoter activity. Chromatin-immunoprecipitation showed binding of Sp1 to the promoter region in vivo. Overexpression of Sp1 in Drosophila Sp1-null SL2 cells suggested that Sp1 is the transactivator of the promoter. The human core promoter was functional in mouse 3T3 and monkey COS7 cells. We found a CpG island which spanned the core promoter and exon 1. COBRA technique did not reveal promoter methylation in 10 normal oral tissues, 14 oral tumors, and two human cell lines HuH7 and A549. This study provides the first insight into the mechanism that controls expression of this imprinted tumor suppressor gene. A COBRA-based assay has been developed to look for promoter methylation in different cancers. The present data will help to understand the regulation of this gene and its role in tumorigenesis. (C) 2008 Elsevier B.V. All rights reserved.

Characterization of the human SLC22A18 gene promoter and its regulation by the transcription factor Sp1

SLC22A18, a poly-specific organic cation transporter, is paternally imprinted in humans and mice. It shows loss-of-heterozygosity in childhood and adult tumors, and gain-of-imprinting in hepatocarcinomas and breast cancers. Despite the importance of this gene, its transcriptional regulation has not been studied, and the promoter has not yet been characterized. We therefore set out to identify the potential cis-regulatory elements including the promoter of this gene. The luciferase reporter assay in human cells indicated that a region from -120 by to +78 by is required for the core promoter activity. No consensus TATA or CHAT boxes were found in this region, but two Sp1 binding sites were conserved in human, chimpanzee, mouse and rat. Mutational analysis of the two Sp1 sites suggested their requirement for the promoter activity. Chromatin-immunoprecipitation showed binding of Sp1 to the promoter region in vivo. Overexpression of Sp1 in Drosophila Sp1-null SL2 cells suggested that Sp1 is the transactivator of the promoter. The human core promoter was functional in mouse 3T3 and monkey COS7 cells. We found a CpG island which spanned the core promoter and exon 1. COBRA technique did not reveal promoter methylation in 10 normal oral tissues, 14 oral tumors, and two human cell lines HuH7 and A549. This study provides the first insight into the mechanism that controls expression of this imprinted tumor suppressor gene. A COBRA-based assay has been developed to look for promoter methylation in different cancers. The present data will help to understand the regulation of this gene and its role in tumorigenesis. (C) 2008 Elsevier B.V. All rights reserved.

Boxicity and cubicity of asteroidal triple free graphs

The boxicity of a graph G, denoted box(G), is the least integer d such that G is the intersection graph of a family of d-dimensional (axis-parallel) boxes. The cubicity, denoted cub(G), is the least dsuch that G is the intersection graph of a family of d-dimensional unit cubes. An independent set of three vertices is an asteroidal triple if any two are joined by a path avoiding the neighbourhood of the third. A graph is asteroidal triple free (AT-free) if it has no asteroidal triple. The claw number psi(G) is the number of edges in the largest star that is an induced subgraph of G. For an AT-free graph G with chromatic number chi(G) and claw number psi(G), we show that box(G) <= chi(C) and that this bound is sharp. We also show that cub(G) <= box(G)([log(2) psi(G)] + 2) <= chi(G)([log(2) psi(G)] + 2). If G is an AT-free graph having girth at least 5, then box(G) <= 2, and therefore cub(G) <= 2 [log(2) psi(G)] + 4. (c) 2010 Elsevier B.V. All rights reserved.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i 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 can be represented as 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 R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.