A thermal molecular migration in the solid-state - structures of isomeric 5-amino-4-(2,6-dichlorophenyl)-1-(2-nitrophenyl)-1h-1,2,3-triazole (yellow form i) and 4-(2,6-dichlorophenyl)-5-(2-nitroanilino)-2h-1,2,3-triazole (red form-ii), c14h9cl2n5o2

Yellow form (I): Mr= 350.09, monoclinic, P2Jn, Z--4, a=9.525(1), b=14.762(1), c= 11.268(1),/t, fl= 107.82 (1) o , V= 1508.3 A 3 , Din(flotation in aqueous KI)= 1.539 (2), D x= 1.541 (2) g cm -3, #(Cu Ka, 2 = 1.5418 A) = 40.58 cm -~, F(000) = 712, T= 293 K, R = 8.8% for 2054 significant refections. Red form (II): Mr= 350.09, triclinic, Pi, Z=2, a=9.796(2), b= 10.750 (2), c= 7.421 (1)A, a= 95.29 (2), fl= 0108-2701/84/111901-05501.50 70.18 (1), y = 92-.76 (2) °, V= 731.9 A 3, Din(flotation in KI) = 1.585 (3), D x = 1.588 (3) g cm -3, ~t(Cu Ka, 2 = 1.5418/~) = 40.58 cm -1, F(000) = 356, T=293 K, R = 5.8% for 1866 significant reflections. There are no unusual bond distances or angles. The triazole and two phenyl rings are planar. On the basis of packing considerations the possibility of intermolecular interactions playing a role in the reactivity of the starting material is ruled out.

Gas-crystal photoreaction: the structures of 4,4'-dimethoxy(thiobenzophenone) (I), C15H14O2S, and 4,4'-bis(dimethylamino)thiobenzophenone (II), C17H20N2S

(I): M r = 258.34, triclinic, Pi, a = 9.810 (3), b=9.635(3), e=15.015(4)A, a=79.11(2), #= 102.38 (3), y = 107.76 (3) o, V= 1308.5 A 3, Z = 4, Din= 1.318 (3) (by flotation in KI solution), D x = 1.311 g cm -3, Cu Ka, 2 = 1.5418/~, g = 20-05 cm -1, F(000) = 544, T---- 293 K, R = 0.074 for 2663 reflections. (II): M r = 284.43, monoclinic, P2~/c, a= 17.029 (5), b=6.706 (5), c= 14.629 (4), t= 113.55 (2) ° , V=1531.4A 3, Z=4, Dm=1.230(5) (by flotation in KI solution), Dx= 1.234gem -3, Mo Ka, 2 = 0.7107 A, g = 1.63 cm-1; F(000) = 608, T= 293 K, R = 0.062 for 855 reflections. The orientation of the C=S chromophores in the crystal lattice and their reactivity in the crystalline state are discussed. The C--S bonds are much shorter than the normal bond length [1.605 (4) (I), 1.665 (8) A (II) cf. 1.71 A].

4-Biphenylyl phenyl thioketone (I), C19H14S, and 1-naphthyl phenyl thioketone (II), C17H12S

(I): Mr=274"39, orthorhombic, Pbca, a = 7.443 (1), b= 32.691 (3), c= 11.828 (2)A, V= 2877.98A 3, Z=8, Din= 1.216 (flotation in KI), D x = 1.266 g cm -3, /~(Cu Ka, 2 = 1.5418 A) = 17.55 cm -1, F(000) = li52.0, T= 293 K, R = 6.8%, 1378 significant reflections. (II): M r = 248.35, orthorhombic, P212~21, a = 5.873 (3), b = 13.677 (3), c = 15-668 (5) A, V = 1260.14 A 3, Z = 4, D,n = 1.297 (flotation in KI), Dx= 1.308 g cm -a, /t(CuKa, 2=1.5418 A) = 19.55 cm -~, F(000) = 520.0, T= 293 K, R = 6.9%, 751 significant reflections. Crystals of (I) and (II) undergo photo-oxidation in the crystallinestate. In (I) the dihedral angle between the phenyl rings of the biphenyl moiety is 46 (1) °. The C=S bond length is 1.611(5) A in (I) and 1.630 (9)/~ in (II). The correlation between molecular packing and reactivity is discussed.

Structure-Reactivity Correlations of Benzoin Alkyl Ethers. Structures of 2-Methoxy-1,2-diphenylethanone (I) and 2-Isopropoxy-1,2-diphenylethanone (II)

(I): C15H1402, Mr---226.27, triclinic, Pi,a=8.441 (2), b= 10.276 (1), c= 15.342 (2)A, a=91.02 (2), ~ t= 79.26 (2), y= 105.88 (2) °, V=1256.8 (4)A 3, Z=4, D,,= 1.209 (flotation in KI),D x - 1.195 g cm -3, #(Mo, 2 = 0.7107/~) = 0.44 cm -~,F(000) = 480, T= 293 K, R -- 0.060 for 1793 significant reflections. (II): C~THlsO2, Mr= 254.83, orthorhombic, Pca21, a=8.476 (1); b= 16.098 (3), c=10.802(3)A, V=1473.9 (5) A s, Z=4, Dm=1.161 (flotation in KI), Dx= 1.148gem -3, /~(Mo, 2=0.7107 A) =0.41 cm -~, F(000) = 544, T= 293 K, R = 0.071 for 867 significant reflections. Both (I) and (II) crystallize in a cisoid conformation for the carbonyl group and alkoxy groups. Compounds (I) and (II) are photostable on irradiation in the solid state in spite of the favourable conformation of the functional groups for intramolecular H abstraction. Absence of photoreaction of (I)and (II) in the solid state is rationalized in the light of unfavourable intramolecular geometry.

Structure of N-nitroso-r-2,c-7-diphenylhexahydro-1,4-diazepin-5-one

C17H17N3O2, M(r) = 295.34, orthorhombic, P2(1)2(1)2(1), a = 7.659 (1), b = 12.741 (1), c = 15.095 (1) angstrom, V = 1473.19 (2) angstrom 3, Z = 4, D(m) = 1.33, D(x) = 1.32 Mg m-3, lambda(Cu K-alpha) = 1.5418 angstrom, mu = 0.68 mm-1, F(000) = 624, T = 295 K, R = 0.031 for 1549 unique observed reflections with I > 2.5-sigma(I). The seven-membered heterocyclic ring adopts a boat conformation flattened at the nitroso end of the ring. The substituent phenyl rings occupy pseudo-axial positions and the nitroso group is coplanar with the C(2), N(1), C(7) plane of the central ring. The crystal structure is stabilized by intermolecular N-H...O and weak C-H...O hydrogen bonds.

Axial binding of 2-methylimidazole to the tetraarylcarboxylatodiruthenium (II, III) core: X-ray crystal structure of [Ru-2(O2CC6H4-p-OMe)(4)(2-mimH)(2)](ClO4). 1.75CH(2)Cl(2).H2O

Diruthenium (II. III) complexes of the type [Ru-2(O2CAr)(4) (2-mimH)(2)](ClO4) (Ar = C6H4-p-X : X=OMe,1, X=Me, 2, 2-mimH=2-methylimidazole) have been isolated from the reaction of Ru2Cl(O2CAr)(4) with 2-mimH in CH2Cl2 followed by the addition of NaClO4. The crystal structure of 1.1.75CH(2)Cl(2).H2O has been determined. The crystal belongs to the monoclinic space group p2(1)/c with the following unit cell dimensions for the C40H40N4O16ClRu2.1.75CH(2)Cl(2).H2O (M = 1237.0) : a = 12.347(3)Angstrom, b = 17.615(5)Angstrom, c = 26.148(2)Angstrom,beta = 92.88(1)degrees. v = 5679(2)Angstrom(3). Z=4, D-c = 1.45 g cm(-3). lambda(Mo-K-alpha) = 0.7107 Angstrom, mu(Mo-K-alpha) = 8.1 cm(-1), T = 293 K, R = 0.0815 (wR(2) = 0.2118) for 5834 reflections with 1 > 2 sigma(I). The complex has a tetracarboxylatodiruthenium (II, III) core and two axially bound 2-methylimidazole ligands. The Ru-Ru bond length is 2.290(1)Angstrom. The Ru-Ru bond order is 2.5 and the complex is three-electron paramagnetic. The complex shows an irreversible Ru-2(II,III)-->Ru-2(Il,II) reduction near -0.2 V vs SCE in CH2Cl2-0. 1 MTBAP. The complexes exemplify the first adduct of the tetracarboxylatodiruthenium (II,III) core having N-donor ligands

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.

Conformational flexibility in androgenic steroids - the structure of a new form of (+)-17-beta-hydroxy-19-nor-4-androsten-3-one (19-nortestosterone), c18h26o2

The structure and conformation of a second crystalline modification of 19-nortestosterone has been determined by X-ray methods. M r = 274, monoclinic P2 l, a=9.755(2), b= 11.467(3), c= 14.196(3)/L fl=101.07(2) ° , V=1558.4 (8) A 3, Z=4, Ox= I. 168 g cm -3, Mo Ka, 2 = 0.7107 ,/k, ~ = 0.80 cm -l, F(000) = 600, T= 300 K. R = 0.060 for 2158 observed reflections. The two molecules in the asymmetric unit show significant differences in the A-ring conformation from that of the previously reported form of the title compound [Precigoux, Busetta, Courseille & Hospital (1975). Acta Cryst. B31, 1527-1532]. The l a,2fl-half-chair conformation of the A ring increases its conformational freedom compared with testosterone.

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

L-Tyrosyl-L-glutarnie Acid Monohydrate, C14H18N206.H20

Mr=328.32, triclinic, P1, a=5.801 (1), b=7.977(1), c=9.110(2)A, ~t=102.33 (1), fl= 97.92 (1), y= 109.82 (1) °, v= 377.2 (1) A 3 at 293 K, Z=I, D x=1.45, D m=1.45 g cm -3, 2(MoKs)= 0.7107 A, ~ = 0.74 cm -1, F(000) = 174.0. R = 0.046 for 990 unique observed [F o > 4O(Fo)] reflections. The crystal structure is stabilized by extensive hydrogen bonding involving all N and O atoms.

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.