The Role of Radical Bridges in Polynuclear Single-Molecule Magnets

Employing radical bridges between anisotropic metal ions has been a viable route to achieve high-performance single-molecule magnets (SMMs). While the bridges have been mainly considered for their ability to promote exchange interactions, the crystal-field effect arising from them has not been taken into account explicitly. This lack of consideration may distort the understanding and limit the development of the entire family. To shed light on this aspect, herein we report a theoretical investigation of a series of N -radical-bridged diterbium complexes. It is found that while promoting strong exchange coupling between the terbium ions, the N -radical induces a crystal field that interferes destructively with that of the outer ligands, and thus reduces the overall SMM behavior. Based on the theoretical results, we conclude that the SMM behavior in this series could be further maximized if the crystal field of the outer ligands is designed to be collinear with that of the radical bridge. This conclusion can be generalized to all exchange-coupled SMMs.     

Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.     

Strong edge-coloring for planar graphs with large girth

A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. Let $G$ be a connected planar graph with girth $k\ge 26$ and maximum degree $\Delta$. We show that either $G$ is isomorphic to a subgraph of a very special $\Delta$-regular graph with girth $k$, or $G$ has a strong edge-coloring using at most $2\Delta +\lceil \frac{12(\Delta -2)}{k}\rceil$ colors.     

The mechanism of ethylene polymerization by nickel salicylaldiminato catalysts - Agostic interactions and their kinetic isotope effects

The ethylene polymerization reaction of a neutral nickel catalyst was studied by DFT calculations at the Becke3LYP/6-31G(d) level of theory. As in related cases a β-agostic bond stabilizes the nickel alkyl ground states. Transition states for the insertion of the olefin show a distinct α-agostic interaction, which has not been observed for late metal polymerization catalysts before. An ethylene-alkyl complex was identified as the resting state of the reaction. The overall barrier height of the reaction amounts to 17.54 kcal/mol, which slightly increases to 17.60 kcal/mol for the polymerization of deuterated ethylene. Therefore, a small positive kinetic isotope effect (k_H/k_D = 1.09) can be calculated, which is caused by the α-agostic interaction in the transition state. A comparison to other late metal based polymerization systems reveals that the ethylene coordination step of highly active catalysts is significantly lower in energy compared to catalysts which are only moderately active.     

人体中的伯努利方程

本文从设计实验入手,形象诠释伯努利原理,并从物理学角度出发,根据人体体液流动的实际情况,运用伯努利原理及经典的伯努利方程,从人体血液循环、房水循环的压力形成和改变方面,把物理学的基本理论运用于分析人体体液压力的变化。     

Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Coxeter Transformation and Quasiquivers

Mathematical Notes -