1,3‐Benzothiazoles as Antimicrobial Agents

Starting from 2‐amino‐1,3‐mercaptobenzothiazoles recently reported ( 1a , 1b , 1c , 1d , 1e , 1f , 1g , 1h ), a series of the corresponding 2‐mercapto‐1,3‐benzothiazole isosters ( 2a , 2b , 2c , 2d , 2e , 2f , 2g , 2h ) were screened for their in vitro antibacterial and antifungal activities. Results underline that the presence of the mercapto moiety at the 2‐position of the heterocyclic nucleus is crucial for activity against bacteria. The biological screening against Candida spp. identified commercial 2f as the most promising compound as antifungal against Candida albicans and tropicalis. Molecular modeling studies supported these results. Then, to enlarge structure‐activity relationship (SAR) studies on series 1 , newly synthesized compounds ( 1k , 1l , 1m , 1n , 1o , 1p ) were reported. All the compounds belonging to this series and bearing a bulky substituent at the 6‐position of the aryl moiety showed high antifungal activity.     

A ferrocenyl‐substituted pseudo­titanocene complex

The title compound, (η⁵‐cyclo­penta­dienyl)[(1,2,3,4,5‐η)‐4‐ferro­cenyl‐1,2,5,6‐tetrakis­(tri­methyl­silyl)­cyclo­hexa‐2,4‐dien‐1‐yl]­titanium(II), [TiFe(C₅H₅)₂(C₂₃H₄₂Si₄)] or [Ti{η⁵‐C₆H₂{Fe­(η⁵‐C₅H₄)(η⁵‐C₅H₅)}{Si(CH₃)₃}₄}(η⁵‐C₅H₅)], possesses two directly linked metallocene units that subtend an angle of 52.9 (1)° (defined by the least‐squares planes of the directly connected π‐ligands) associated with the steric requirements of the bulky tri­methyl­silyl substituents. The cyclo­hexa­dienyl ligand adopts an envelope conformation; the perpendicular distance of its η⁵‐plane to the Ti atom is 1.512 (1) Å.     

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

This paper considers the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph vertex-biconnected. A real-world instance of this problem is the enhancement of an already established computer network to become robust against single node failures. The presented memetic algorithm includes effective preprocessing of problem data and a fast local improvement strategy which is applied before a solution is included into the population. In this way, the memetic algorithm's population consists always of only feasible, locally optimal solution candidates. Empirical results on two sets of test instances indicate the superiority of the new approach over two previous heuristics and an earlier genetic algorithm.     

Coordination behaviour of the 2‐(N,N‐dimethylaminomethyl)phenyl ligand towards the di‐t‐butylchlorotin(IV) moiety

{2‐(N,N‐Dimethylaminomethyl)phenyl}(di‐t‐butyl)tin(IV)chloride, {2‐[(CH₃)₂NCH₂]C₆H₄}Sn(t‐Bu)₂ Cl, has been prepared and characterized using NMR and crystallography. This is the first example of a triorganotin(IV) halide containing the 2‐[(CH₃)₂NCH₂]C₆H₄—group as a C,N‐chelating ligand with a weak intramolecular Sn—N interaction because of the steric hindrance of t‐butyl groups. The interatomic Sn—N distance is elongated to 2.904(14) Å and the central tin atom is distorted trigonal bipyramidal. Copyright © 2004 John Wiley & Sons, Ltd.     

The structural transitions in ferronematics and ferronematic droplets

The paper presents an overview of the observations of structural transitions in ferronematic based on thermotropic nematic 6CHBT (4-trans-4′-n-hexyl-cyclohexyl-isothiocyanato-benzene) and in ferronematic droplets. The type of anchoring was determined using the results of the capacitance measurements. The ferronematic droplets were observed in solutions of nematogenic 6CHBT with fine magnetic particles and phenyl isocyanate. The phase diagram of the transitions between isotropic and nematic phases was found. The magneto-dielectric measurements of various structural transitions in this new system enabled to estimate the type of anchoring of nematic molecules on magnetic particles surfaces in droplets.     

Mostar index

We propose and investigate a new bond-additive structural invariant as a measure of peripherality in graphs. We first determine its extremal values and characterize extremal trees and unicyclic graphs. Then we show how it can be efficiently computed for large classes of chemically interesting graphs using a variant of the cut method introduced by Klav?ar, Gutman and Mohar. Explicit formulas are presented for several classes of benzenoid graphs and Cartesian products. At the end we state several conjectures and list some open problems.