The Picone identity: A device to get optimal uniqueness results and global dynamics in Population Dynamics

This paper infers from a generalized Picone identity the uniqueness of the stable positive solution for a class of semilinear equations of superlinear indefinite type, as well as the uniqueness and global attractivity of the coexistence state in two generalized diffusive prototypes of the symbiotic and competing species models of Lotka–Volterra. The optimality of these uniqueness theorems reveals the tremendous strength of the Picone identity.     

Photo-Controlled Macroscopic Self-Assembly Based on Photo-Switchable Hetero-Complementary Quadruple Hydrogen Bonds

A photo-switchable hetero-complementary quadruple H-bonding array, which consists of an azobenzene-derived ureidopyrimidinone (UPy) module ( Azo-UPy ) and a nonphotoactive diamidonaphthyridine (DAN) derivative ( Napy-1 ), is constructed based on a reversible photo-locking approach. Upon UV (390 nm)/Vis (460 nm) light irradiations, photo-switchable quadruple H-bonded dimerization between Azo-UPy and Napy-1 can be achieved with exhibiting 4.8×10⁴-fold differences in binding strength (ON/OFF ratios). Furthermore, smart polymeric gels with unique photo-controlled macroscopic self-assembly behavior can be fabricated by introducing such quadruple H-bonding array as photo-regulable noncovalent interfacial connections.     

若干图类的邻强边染色

研究了若干图类的邻强边染色 .利用在图中添加辅助点和边的方法 ,构造性的证明了对于完全图 Kn和路 Lm 的笛卡尔积图 Kn× Lm,有χ′as(Kn× Lm) =△ (Kn× Lm) +1 ,其中△ (Kn× Lm)和χ′as(Kn× Lm)分别表示图 Kn× Lm的最大度和邻强边色数 .同理验证了 n阶完全图 Kn的广义图 K(n,m)满足邻强边染色猜想 .     

4一致反超图的最小边数问题

混合超图是在超图的基础上添加一个反超边得到的图．超边和反超边的区别主要体现在着色要求上．在着色中,要求每一超边至少要有两个点着不同的颜色,而每一反超边至少有两个点着相同的颜色．最大最小颜色数分别称为混合超图的上色数和下色数。本文主要研究反超图,即只含反超边的超图。讨论了上色数为3的4一致超图的最小边数问题．给出了上色数为3的4一致反超图的最小边数的一个上界和一个下界．     

平行机半在线排序问题研究(Ⅰ)

对半在线平行机排序问题的研究进展作了详细综述和进一步探讨。文章给出半在线排序问题的背景、定义、分类和求解。介绍它们定义和在不同机器环境和目标函数下半在线排序问题分类，以及第一类半在线模型的近似算法的设计及其竞争比分析。     

Dynamics of the periodic type-K competitive Kolmogorov systems

For time-periodic dissipative and irreducible type-K competitive Kolmogorov systems, it is proved that there is a canonically defined countable family F of unordered, disjoint invariant sets with the property that, for every persistent trajectory whose ω-limit set is not a cycle, there exists a unique trajectory in some element of F such that these two trajectories are asymptotic and the corresponding points in these two trajectories are K-related.     

Halin-图的点强全染色

图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}．χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数．对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图．本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度．     

Partitioning series-parallel multigraphs into ν *-excluding edge covers

We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for actually finding such a partition by our proof.