Hydrogen-bond-directed self-assembly of D-(+)-dibenzoyltartaric acid and 4-aminopyridine: optical nonlinearities and stoichiometry-dependent novel structural features

Attempts to prepare hydrogen-bond-directed nonlinear optical materials from a 1:1 molar mixture Of D-(+)-dibenzoyltartaric acid (DBT, I) and 4-aminopyridine (4-AP, II) resulted in two salts of different stoichiometry. One of them crystallizes in an unusual 1.5:1 (acid:base) monohydrate salt form III while the other one crystallizes as 1:1 (acid:base) salt IV. Crystal structures of both of the salts were determined from single-crystal X-ray diffraction data. The salt III crystallizes in a monoclinic space group C2 with a = 30.339(l), b = 7.881(2), c = 14.355(1) angstrom, beta = 97.48(1)degrees, V = 3403.1(9) angstrom3, Z = 4, R(w) = 0.058, R(w)= 0.058. The salt IV also crystallizes in a monoclinic space group P2(1) with a = 7.500(1), b = 14.968(2), c = 10.370(1) angstrom, beta = 102.67(1)degrees, V = 1135.9(2) angstrom3, Z = 2, R = 0.043, R(w) = 0.043. Interestingly, two DBT molecules with distinctly different conformation are present in the same crystal lattice of salt III. Extensive hydrogen-bonding interactions are found in both of the salts, and both of them show SHG intensity 1.4-1.6 times that of urea.

Chordal Bipartite Graphs with High Boxicity

The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater than 4. It was conjectured by Otachi, Okamoto and Yamazaki that chordal bipartite graphs have boxicity at most 2. We disprove this conjecture by exhibiting an infinite family of chordal bipartite graphs that have unbounded boxicity.

Some results on the reconstruction problems. p-claw-free, chordal, and p4-reducible graphs

A claw is an induced subgraph isomorphic to K-1,K-3. The claw-point is the point of degree 3 in a claw. A graph is called p-claw-free when no p-cycle has a claw-point on it. It is proved that for p greater than or equal to 4, p-claw-free graphs containing at least one chordless p-cycle are edge reconstructible. It is also proved that chordal graphs are edge reconstructible. These two results together imply the edge reconstructibility of claw-free graphs. A simple proof of vertex reconstructibility of P-4-reducible graphs is also presented. (C) 1995 John Wiley and Sons, Inc.

Template directed asymmetric synthesis of the 1,1?-binaphthol unit

An oxidative binaphthol coupling with 65% yield and 65% selectivity has been accomplished using 7-deoxycholic acid as a chiral template.

Hydrogen-Bond-Directed Nonlinear-Optical Organic Materials - Evidence For The Control Of 2nd-Harmonic Generation Activities From The X-Ray Crystal-Structures Of The Complexes Of L-Tartaric Acid With M-Anisidine and P-Toluidine

Several substituted anilines were converted to binary salts with L-tartaric acid. Second harmonic generation (SHG) activities of these salts were determined. The crystal packing in two structures, (i) m-anisidinium-L-tartrate monohydrate (i) and (ii) p-toluidinium-L-tartrate (2), studied using X-ray diffraction demonstrates that extensive hydrogen bonding steers the components into a framework which has a direct bearing on the SHG activity

Model studies directed towards the synthesis of functionalised chiral A-ring derivatives of taxanes

Model studies, starting from the monoterpene R-carvone, directed towards the synthesis of chiral A-ring derivatives of taxanes with oxygen functionalities at C-2, 9 and 13 carbon atoms as in taxol is described.

The existence of homeomorphic subgraphs in chordal graphs

We establish conditions for the existence, in a chordal graph, of subgraphs homeomorphic to K-n (n greater than or equal to 3), K-m,K-n (m,n greater than or equal to 2), and wheels W-r (r greater than or equal to 3). Using these results, we develop a simple linear time algorithm for testing planarity of chordal graphs. We also show how these results lead to simple polynomial time algorithms for the Fixed Subgraph Homeomorphism problem on chordal graphs for some special classes of pattern graphs.

Combinatorial logic synthesis using technology directed decomposition

The aim of logic synthesis is to produce circuits which satisfy the given boolean function while meeting timing constraints and requiring the minimum silicon area. Logic synthesis involves two steps namely logic decomposition and technology mapping. Existing methods treat the two as separate operation. The traditional approach is to minimize the number of literals without considering the target technology during the decomposition phase. The decomposed expressions are then mapped on to the target technology to optimize the area, Timing optimization is carried out subsequently, A new approach which treats logic decomposition and technology maping as a single operation is presented. The logic decomposition is based on the parameters of the target technology. The area and timing optimization is carried out during logic decomposition phase itself. Results using MCNC circuits are presented to show that this method produces circuits which are 38% faster while requiring 14% increase in area.

Synthetic studies directed towards the potent cytotoxic natural product ottelione A: stereoselective construction of the complete framework

A stereoselective strategy for the rapid acquisition of the complete framework (dideoxyottelione A) of the promising cytotoxic agent ottelione A, with four contiguous stereogenic centres on a hydrindane skeleton and a sensitive 4-methylenecyclohex-2-enone functionality, from the readily available Diels-Alder adduct of 1,2,3,4-tetrachloro-5,5-dimethoxycyclopentadiene and norbornadiene, is delineated.

Acyclic Edge-Coloring of Planar Graphs

A proper edge-coloring with the property that every cycle contains edges of at least three distinct colors is called an acyclic edge-coloring. The acyclic chromatic index of a graph G, denoted. chi'(alpha)(G), is the minimum k such that G admits an acyclic edge-coloring with k colors. We conjecture that if G is planar and Delta(G) is large enough, then chi'(alpha) (G) = Delta (G). We settle this conjecture for planar graphs with girth at least 5. We also show that chi'(alpha) (G) <= Delta (G) + 12 for all planar G, which improves a previous result by Fiedorowicz, Haluszczak, and Narayan Inform. Process. Lett., 108 (2008), pp. 412-417].

A gradient PCR-based screen for use in site-directed mutagenesis

Site-directed mutagenesis is widely used to study protein and nucleic acid structure and function. Despite recent advancements in the efficiency of procedures for site-directed mutagenesis, the fraction of site-directed mutants by most procedures rarely exceeds 50% on a routine basis and is never 100%. Hence it is typically necessary to sequence two or three clones each time a site-directed mutant is constructed. We describe a simple and robust gradient-PCR-based screen for distinguishing site-directed mutants from the starting, unmutated plasmid. The procedure can use either purified plasmid DNA or colony PCR, starting from a single colony. The screen utilizes the primer used for mutagenesis and a common outside primer that can be used for all other mutants constructed with the same template. Over 30 site-specific mutants in a variety of templates were successfully screened and all of the mutations detected were subsequently confirmed by DNA sequencing. A single base pair mismatch could be detected in an oligonucleotide of 36 bases. Detection efficiency was relatively independent of starting template concentration and the nature of the outside primer used. (C) 2003 Elsevier Science (USA). All rights reserved.

Boxicity of Line Graphs

The boxicity of a graph H, denoted by View the MathML source, is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in View the MathML source. In this paper we show that for a line graph G of a multigraph, View the MathML source, where Δ(G) denotes the maximum degree of G. Since G is a line graph, Δ(G)≤2(χ(G)−1), where χ(G) denotes the chromatic number of G, and therefore, View the MathML source. For the d-dimensional hypercube Qd, we prove that View the MathML source. The question of finding a nontrivial lower bound for View the MathML source was left open by Chandran and Sivadasan in [L. Sunil Chandran, Naveen Sivadasan, The cubicity of Hypercube Graphs. Discrete Mathematics 308 (23) (2008) 5795–5800]. The above results are consequences of bounds that we obtain for the boxicity of a fully subdivided graph (a graph that can be obtained by subdividing every edge of a graph exactly once).

Electric Field Directed Growth of Molecular Wires of Charge Transfer Molecules on Prefabricated Metal Electrodes

Molecular wires of charge transfer molecules were formed by co-evaporating the 7 7 8 8-Tetracyanoquinodimethane [TCNQ] (acceptor) and Tetrathiafulvalene [TTF] (donor) molecules across prefabricated metal electrodes. Molecular wires of TTF TCNQ were also formed by evaporating single complex of TTF:TCNQ across prefabricated metal electrodes The prefabricated metal electrodes were made using electron beam lithography on SiO2 and glass cover slip substrates. Even though TTF: TCNQ wires grown from both co-evaporation and evaporation techniques show semiconductor like behavior in temperature dependence of resistance they show different activation energies due the difference in stoichiometry of TTF and TCNQ.

Percolation and Connectivity in AB Random Geometric Graphs

Given two independent Poisson point processes ©(1);©(2) in Rd, the AB Poisson Boolean model is the graph with points of ©(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centred at these points contains at least one point of ©(2). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d ¸ 2 and derive bounds for a critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and cn in the unit cube. The AB random geometric graph is de¯ned as above but with balls of radius r. We derive a weak law result for the largest nearest neighbour distance and almost sure asymptotic bounds for the connectivity threshold.