具有唯一4度最大度点的图的全色数

一个图Ｇ的全色数χ_T（Ｇ）是使得Ｖ（Ｇ）∪Ｅ（Ｇ）中相邻或相关联元素均染不同颜色的最少颜色数．文中证明了，若图Ｇ只有唯一的一个４度最大度点，则χ_T（Ｇ）＝Δ（Ｇ）＋１．     

Functional Central Limit Theorems for Triangular Arrays of Function-Indexed Processes under Uniformly Integrable Entropy Conditions

Functional central limit theorems for triangular arrays of rowwise independent stochastic processes are established by a method replacing tail probabilities by expectations throughout. The main tool is a maximal inequality based on a preliminary version proved by P. Gaenssler and Th. Schlumprecht. Its essential refinement used here is achieved by an additional inequality due to M. Ledoux and M. Talagrand. The entropy condition emerging in our theorems was introduced by K. S. Alexander, whose functional central limit theorem for so-calledmeasure-like processeswill be also regained. Applications concern, in particular, so-calledrandom measure processeswhich include function-indexed empirical processes and partial-sum processes (with random or fixed locations). In this context, we obtain generalizations of results due to K. S. Alexander, M. A. Arcones, P. Gaenssler, and K. Ziegler. Further examples include nonparametric regression and intensity estimation for spatial Poisson processes.     

Diagrams,orientations, and varieties

One of the central problems in the theory of ordered sets is to describe the orientations of the covering graph of an ordered set. We show that the particular operation called inversion, together with the classical constructions of retraction and product, provide a context for the classification of all such orientations. AMS subject classifications (1980). 06A10, 05C75, 05C20.     

酶分子在试管内的定向进化及其在手性有机物合成中的应用

本文扼要介绍了当今改进酶分子性能的有效手段———分子定向进化技术的基本方法如易错PCR和DNA洗牌,以及派生的一些新技术的原理与进展,并列举了在手性有机物合成中一些成功的实例,为该领域的研究与应用提供了一些新的信息。     

Global Forcing Number of Benzenoid Graphs

A global forcing set in a simple connected graph G with a perfect matching is any subset S of E(G) such that the restriction of the characteristic function of perfect matchings of G on S is an injection. The number of edges in a global forcing set of the smallest cardinality is called the global forcing number of G. In this paper we prove several results concerning global forcing sets and numbers of benzenoid graphs. In particular, we prove that all catacondensed benzenoids and catafused coronoids with n hexagons have the global forcing number equal to n, and that for pericondensed benzenoids the global forcing number is always strictly smaller than the number of hexagons.     

Unicyclic Graphs with Minimal Energy

If G is a graph and ₁,₂,..., _n are its eigenvalues, then the energy of G is defined as E(G)=|₁|+|₂|++| _n |. Let S _n ³ be the graph obtained from the star graph with n vertices by adding an edge. In this paper we prove that S _n ³ is the unique minimal energy graph among all unicyclic graphs with n vertices (n6).     

The de novo design of median molecules within a property range of interest

Summary In this paper an application is presented of the median molecule workflow to the de novo design of novel molecular entities with a property profile of interest. Median molecules are structures that are optimised to be similar to a set of existing molecules of interest as an approach for lead exploration and hopping. An overview of this workflow is provided together with an example of an instance using the similarity to camphor and menthol as objectives. The methodology of the experiments is defined and the workflow is applied to designing novel molecules for two physical property datasets: mean molecular polarisability and aqueous solubility. This paper concludes with a discussion of the characteristics of this method.     

On the Permanental Polynomials of Some Graphs

Let G be a simple graph with adjacency matrix A(G) and (G,x) the permanental polynomial of G. Let G × H denotes the Cartesian product of graphs G and H. Inspired by Kleins idea to compute the permanent of some matrices (Mol. Phy. 31 (3) (1976) 811–823), in this paper in terms of some orientation of graphs we study the permanental polynomial of a type of graphs. Here are some of our main results.1.If G is a bipartite graph containing no subgraph which is an even subdivision of K _2,3, then G has an orientation G ^e such that (G,x) = det (xI-A(G ^e )), where A(G ^e ) denotes the skew adjacency matrix of G ^e.2.Let G be a 2-connected outerplanar bipartite graph with n vertices. Then there exists a 2-connected outerplanar bipartite graph with 2n+2 vertices such that (G,x) is a factor of .3.Let T be an arbitrary tree with n vertices. Then , where ₁ , ₂ , ..., _n are the eigenvalues of T.     

Electrode processes in the oxidation of tetrahydroisoquinoline derivatives

The electrochemical oxidation of the alkaloid laudanosine (Ia) to O-methylflavinantine (II) has been studied in acetonitrile solvent. Using cyclic voltammetry, rotating disc voltammetry and preparative electrolyses on several alkaloids, simple aliphatic amines and aromatic compounds, some aspects of the mechanism of this coupling reaction are elucidated. The first anodic wave for laudanosine at platinum has E_p=0.55 V vs. Ag/Ag⁺. The electrode rapidly becomes partially passivated at potentials above 0.5 V. This is due to a film which “dissolves” below 0.5 V, at a rate independent of the potential. It is shown that the reaction (Ia)→(II) proceeds at 0.5 V by initial oxidation of the amine moiety. If acids such as sodium bicarbonate are added to the anolyte the amine is protonated causing the first wave to disappear. Oxidation at 1.1 V under these acidic conditions produces the same product, but more rapidly and in significantly higher yield because electrode filming and side reactions resulting from the amine oxidation are abrogated.