Studies on the metabolism of a monoterpene ketone, R-(+)-pulegone-a hepatotoxin in rat: isolation and characterization of new metabolites

1. The metabolic disposition of R-(+)-pulegone (1) was examined in rats following four daily oral doses (250 mg/kg). 2. Six metabolites, namely pulegol (II), 2-hydroxy-2-(1-hydroxy-1-methylethyl)-5-methylcyclohexanone (III), 3,6-dimethyl-7a-hydroxy-5,6,7,7a-tetrahydro-2(4H)-benzofuranone (IV), menthofuran (V), 5-methyl-2-(1-methyl-1-carboxyethylidene)cyclohexanone (VI), and 5-methyl-5-hydroxy-2-(1-hydroxy-1-carboxyethyl)cyclohexanone (VII) have previously been isolated from rat urine, and identified (Moorthy et al. (1989a). Eight new metabolites have now been isolated from rat urine, namely, 5-hydroxy-pulegone (VIII), piperitone (IX), piperitenone (X), 7-hydroxy-piperitone (XI), 8-hydroxy piperitone (XII), p-cresol (XIII), geranic acid (XIV) and neronic acid (XV). These were identified by n.m.r., i.r. and mass spectrometry. 3. Based on these results, metabolic pathways for the biotransformation of R-(+)-pulegone in rat have been proposed.

Immunization of male rabbits with sheep luteal receptor to LH results in production of antibodies exhibiting hormone-agonistic and -antagonistic activities

Antibodies to LH/chorionic gonadotrophin receptor (LH/CG-R; molecular weight 67 000), isolated in a homogenous state (established by SDS-PAGE and ligand blotting) from sheep luteal membrane using human CG (hCG)-Sepharose affinity chromatography, were raised in three adult male rabbits (R-I, R-II and R-III). Each of the rabbits received 20-30 mu g oi the purified receptor in Freund's complete adjuvant at a time. Primary immunization was followed by booster injection at intervals. Production of receptor antibodies was monitored by (1) determining the dilution of the serum (IgG fraction) that could specifically bind 50% of I-125-LH/CG-R added and (2) analysing sera for any chance in testosterone levels. Following primary immunization and the first booster, all three rabbits exhibited a 2.5- to 6.0-fold increase in serum testosterone over basal levels and this effect was spread over a period of time (similar to 40 days) coinciding with the rise and fall of receptor antibodies. The maximal antibody titre (ED(50)) produced at this time ranged from 1:350 to 1:100 to below detectable limits for R-I, R-II and R-III respectively. Subsequent immunizations followed by the second booster resulted in a substantial increase in antibody titre (ED(50) of 1:5000) in R-I, but this was not accompanied by any change in serum testosterone over preimmune levels, suggesting that with the progress of immunization the character of the antibody produced had also changed. Two pools of antisera from R-I collected 10 days following the booster (at day 70 (bleed I) and day 290 (bleed II)) were used in further experiments. IgG isolated from bleed I but not from bleed II antiserum showed a dose-dependent stimulation of testosterone production by mouse Leydig cells in vitro, thus confirming the in vivo hormone-mimicking activity antibodies generated during the early immunization phase. The IgG fractions from both bleeds were, however, capable of inhibiting (1) I-125-hCG binding to crude sheep luteal membrane (EC(50) of 1:70 and 1:350 for bleed I and II antisera respectively) and (2) ovine LH-stimulated testosterone production by mouse Leydig cells in vitro, indicating the presence oi antagonistic antibodies irrespective of the period of time during which the rabbits were immunized. The: fact that bleed I-stimulated testosterone production could be inhibited in a dose-dependent manner by the addition of IgG from bleed II to the mouse Leydig cell in vitro assay system showed that the agonistic activity is intrinsic to the bleed I antibody. The receptor antibody (bleed II) was also capable of blocking LH action in vivo, as rabbits passively (for 24 h with LH/CG-R antiserum) as well as actively (for 130 days) immunized against LH/CG-R failed to respond to a bolus injection of LH (50 mu g). At no time, however, was the serum testosterone reduced below the basal level. This study clearly shows that, unlike with LH antibody, attempts to achieve an LH deficiency effect in vivo by resorting to immunization with hole LH receptor is difficult, as receptor antibodies exhibit both hormone-mimicking (agonistic) as well as hormone-blocking (antagonistic) activities.

On the cubicity of bipartite graphs

A unit cube in k-dimension (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 on the real line of the form [a(j), 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. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph. It is known that for graph G, cub(G) <= left perpendicular2n/3right perpendicular. Recently it has been shown that for a graph G, cub(G) >= 4(Delta + 1) In n, where n and Delta are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G = (A boolean OR B, E) with |A| = n(1), |B| = n2, n(1) <= n(2), and Delta' = min {Delta(A),Delta(B)}, where Delta(A) = max(a is an element of A)d(a) and Delta(B) = max(b is an element of B) d(b), d(a) and d(b) being the degree of a and b in G, respectively , cub(G) <= 2(Delta' + 2) bar left rightln n(2)bar left arrow. We also give an efficient randomized algorithm to construct the cube representation of G in 3 (Delta' + 2) bar right arrowIn n(2)bar left arrow dimension. The reader may note that in general Delta' can be much smaller than Delta.

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.

On the Cubicity of Interval Graphs

A k-cube (or ``a unit cube in k dimensions'') is defined as the Cartesian product R-1 x . . . x R-k where R-i (for 1 <= i <= k) is an interval of the form [a(i), a(i) + 1] on the real line. The k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that the k-cubes corresponding to two vertices in G have a non-empty intersection if and only if the vertices are adjacent. The cubicity of a graph G, denoted as cub(G), is defined as the minimum dimension k such that G has a k-cube representation. 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. We show that for any interval graph G with maximum degree Delta, cub(G) <= inverted right perpendicular log(2) Delta inverted left perpendicular + 4. This upper bound is shown to be tight up to an additive constant of 4 by demonstrating interval graphs for which cubicity is equal to inverted right perpendicular log(2) Delta inverted left perpendicular.

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).

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.

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

A unit cube in k dimensions (k-cube) is defined as the 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), a(i) + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of C can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes. An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step. We give an O(bw . n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Delta) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Delta) bandwidth. Thus we have: 1. cub(G) <= 3 Delta - 1, if G is an AT-free graph. 2. cub(G) <= 2 Delta + 1, if G is a circular-arc graph. 3. cub(G) <= 2 Delta, if G is a cocomparability graph. Also for these graph classes, there axe constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Delta) width. We can thus generate the cube representation of such graphs in O(Delta) dimensions in polynomial time.

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.

The stereochemistry of a-aminoisobutyric acid containing peptides

a-Aminoisobutyric acid (Aib), * a nonprotein amino acid first described synthetically, I has been found in diverse sources, ranging from peptides of microbial origin2s3 to the Murchison mete~r i te.E~a rly studies of the chemistry of Aib were directed towards the synthesis of model peptides containing this "sterically hindered" amino There have been several reports on the synthesis of Aib containing analogs of biologically active peptides.

Vinyl Monomer Based Polyperoxides as Potential Initiators for Radical Polymerization: An Exploratory Investigation with Poly(.alpha.-methylstyrene peroxide)

We describe the use of poly(alpha-methylstyrene peroxide) (P alpha MSP), an alternating copolymer of alpha-methylstyrene and oxygen, as initiator for the radical polymerization of vinyl monomers. Thermal decomposition of P alpha MSP in 1,4-dioxane follows first-order kinetics with an activation energy (E(a)) of 34.6 kcal/mol. Polymerization of methyl methacrylate (MMA) and styrene using P alpha MSP as an initiator was carried out in the temperature range 60-90 degrees C. The kinetic order with respect to the initiator and the monomer was close to 0.5 and 1.0, respectively, for both monomers. The E(a) for the polymerization was 20.6 and 22.9 kcal/mol for MMA and styrene, respectively. The efficiency of P alpha MSP was found to be in the range 0.02-0.04. The low efficiency of P alpha MSP was explained in terms of the unimolecular decomposition of the alkoxy radicals which competes with primary radical initiation. The presence of peroxy segments in the main chain of PMMA and polystyrene was confirmed from spectroscopic and DSC studies. R(i)'/2I values for P alpha MSP compared to that of BPO at 80 degrees C indicate that P alpha MSP can be used as an effective high-temperature initiator.

Boxicity of Circular Arc Graphs

A k-dimensional box is a Cartesian product R(1)x...xR(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. That is, two vertices are adjacent if and only if their corresponding boxes intersect. A circular arc graph is a graph that can be represented as the intersection graph of arcs on a circle. We show that if G is a circular arc graph which admits a circular arc representation in which no arc has length at least pi(alpha-1/alpha) for some alpha is an element of N(>= 2), then box(G) <= alpha (Here the arcs are considered with respect to a unit circle). From this result we show that if G has maximum degree Delta < [n(alpha-1)/2 alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. We also demonstrate a graph having box(G) > alpha but with Delta = n (alpha-1)/2 alpha + n/2 alpha(alpha+1) + (alpha+2). For a proper circular arc graph G, we show that if Delta < [n(alpha-1)/alpha] for some alpha is an element of N(>= 2), then box(G) <= alpha. Let r be the cardinality of the minimum overlap set, i.e. the minimum number of arcs passing through any point on the circle, with respect to some circular arc representation of G. We show that for any circular arc graph G, box(G) <= r + 1 and this bound is tight. We show that if G admits a circular arc representation in which no family of k <= 3 arcs covers the circle, then box(G) <= 3 and if G admits a circular arc representation in which no family of k <= 4 arcs covers the circle, then box(G) <= 2. We also show that both these bounds are tight.

Reactions of Titanocene Bis(trimethylsilyl)acetylene Complexes with Carbodiimides: An Experimental and Theoretical Study of Complexation versus C-N Bond Activation

The reaction of the low valent metallocene(II) sources Cp'Ti-2(eta(2)-Me3SiC2SiMe3) (Cp' = eta(5)-cyclopentadienyl, 1a or eta(5)-pentamethylcyclopentadienyl, 1b) with different carbodiimide substrates RN=C=NR' 2-R-R' (R = t-Bu; R' = Et; R = R' = i-Pr; t-Bu; SiMe3; 2,4,6-Me-C6H2 and 2,6-i-Pr-C6H3) was investigated to explore the frontiers of ring strained, unusual four-membered heterometallacycles 5-R. The product complexes show dismantlement, isomerization, or C-C coupling of the applied carbodiimide substrates, respectively, to form unusual mono-, di-, and tetranuclear titanium(III) complexes. A detailed theoretical study revealed that the formation of the unusual complexes can be attributed to the biradicaloid nature of the unusual four-membered heterometallacycles 5-R, which presents an intriguing situation of M-C bonding. The combined experimental and theoretical study highlights the delicate interplay of electronic and steric effects in the stabilization of strained four-membered heterometallacycles, accounting for the isolation of the obtained complexes.

Cubicity and Bandwidth

A unit cube in (or a k-cube in short) is defined as the Cartesian product R (1) x R (2) x ... x R (k) where R (i) (for 1 a parts per thousand currency sign i a parts per thousand currency sign k) is a closed interval of the form a (i) , a (i) + 1] on the real line. A k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that two vertices in G are adjacent if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G is the minimum k such that G has a k-cube representation. From a geometric embedding point of view, a k-cube representation of G = (V, E) yields an embedding such that for any two vertices u and v, ||f(u) - f(v)||(a) a parts per thousand currency sign 1 if and only if . We first present a randomized algorithm that constructs the cube representation of any graph on n vertices with maximum degree Delta in O(Delta ln n) dimensions. This algorithm is then derandomized to obtain a polynomial time deterministic algorithm that also produces the cube representation of the input graph in the same number of dimensions. The bandwidth ordering of the graph is studied next and it is shown that our algorithm can be improved to produce a cube representation of the input graph G in O(Delta ln b) dimensions, where b is the bandwidth of G, given a bandwidth ordering of G. Note that b a parts per thousand currency sign n and b is much smaller than n for many well-known graph classes. Another upper bound of b + 1 on the cubicity of any graph with bandwidth b is also shown. Together, these results imply that for any graph G with maximum degree Delta and bandwidth b, the cubicity is O(min{b, Delta ln b}). The upper bound of b + 1 is used to derive upper bounds for the cubicity of circular-arc graphs, cocomparability graphs and AT-free graphs in terms of the maximum degree Delta.