一类图的特征多项式与匹配多项式

本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。     

A new method for atmospheric nitrogen dioxide measurements using the combination of a stripping coil and fluorescence detection.

A new stripping coil for the collection of nitrogen dioxide (NO2) has been developed to increase its versatility and efficiency. Nitrogen dioxide measurements based on quantitative collection through a reaction coil into an alkaline solution has been examined. Nitrogen dioxide is collected in a 0.1 N NaOH solution. This collection system has an efficiency of nearly 100%. The absorbed nitrogen dioxide has been measured by fluorescence detection with sub-ppbv detection limits. The excitation wavelength at 360 nm and the produced emission wavelength at 405 nm were suitable for nitrite ion measurements.     

Enumeration of perfect matchings of a type of Cartesian products of graphs

Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by P_m and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let C_n denote the cycle with n vertices. Then Pm(C₄×T)=∏(2+α²), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C₄×T) is always a square or double a square.2. Let T be a tree. Then Pm(P₄×T)=∏(1+3α²+α⁴), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P₃×T)=∏(2+α²), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C₄×T)=[Pm(P₃×T)]².     

Fully-angular polyhex chains with minimal total π-electron energy

By Hückel molecular orbital (HMO) theory, the calculation of the total energy of all π-electrons in conjugated hydrocarbons can be reduced to that of E(G)=|λ₁|+|λ₂|+?+|λn|, where λi are the eigenvalues of the corresponding graph G. Denote by Ψn the set of all fully-angular polyhex chains with n hexagons. In this paper, we show that Hn has the minimum total π-electron energy among chains in Ψn, where Hn is the helicene chain.     

Constructive and Destructive Two-Pulse Excitation Investigated with a White-Light Michelson Interferometer

Linear propagation of two pulses through methanol solution of aluminum phthalocyanine chloride is investigated using a modified white-light Michelson interferometer. The observed coherence time of the white light is 6 fs, and the separation between the two-excitation pulses is set to about 10 fs. The excitation is dependent on the phase-relation between the two pulses. We have observed an enhancement of the excitation when the two pulses are in-phase and strong suppression of the excitation when the two pulses are out of phase by π.     

Formation of non-racemic E- and Z-olefins based on discrimination of enantiotopic carbonyl groups in α-diketones by a chiral phosphonate reagent

A chiral HWE reagent reacted with an alternative carbonyl group of meso-α-diketones of bicyclo[2.2.1] system to give non-racemic (Z)- and (E)-olefins, respectively.     

Double hexagonal chains with minimal total <Emphasis Type="Italic">π</Emphasis>-electron energy

The total energy of all π-electrons in a conjugated hydrocarbon (within the framework of HMO approximation) is the sum of the absolute value of all the eigenvalues of its corresponding graph. In this paper, we consider “double hexagonal chains” as benzenoids constructed by successive fusions of successive naphthalenes along a zig–zag sequence of triples of edges as appear on opposite sides of each naphthalene unit. It is shown that if the fusions are such as to give a polyaceacene then the total π-electron energy is the minimum from among all the double hexagonal chains with the same number of naphthalene units.      

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.