Lotka-Volterra树系统全局渐近稳定性的判据

本文通过引入种群度的概念,给出一组很容易验证的判断n维Lotka-Volterra树系统存在全局渐近稳定非负平衡点的充分条件。     

Spanning trees with leaf distance at least four

For a graph G, we denote by i(G) the number of isolated vertices of G. We prove that for a connected graph G of order at least five, if i(G–S) < |S| for all ?? ≠ S ? V(G), then G has a spanning tree T such that the distance in T between any two leaves of T is at least four. This result was conjectured by Kaneko in “Spanning trees with constrains on the leaf degree”, Discrete Applied Math, 115 (2001), 73–76. Moreover, the condition in the result is sharp in a sense that the condition i(G–S) < |S| cannot be replaced by i(G–S) ≤ |S|. © 2006 Wiley Periodicals, Inc. J Graph Theory 55: 83–90, 2007     

Four Coefficients of Characteristic Polynomials of Coxeter Transformations

Mathematical Notes -     

On family trees and subtrees of simple branching processes

We study the probability of occurrence of certain subtrees of the family tree of a Galton Watson branching process.     

具有给定匹配大小的极小能量树

共轭分子的π-电子总能量可通过其相应的分子图来计算,即相应图的邻接矩阵的 特征值的绝对值之和.本文给出了具有给定匹配大小的一类树图的最小能量值和次小能 量值,并给出了达到最小能量值和次小能量值的树的刻划.     

Binary tree approach to scaling in unimodal maps

Ge, Rusjan, and Zweifel introduced a binary tree which represents all the periodic windows in the chaotic regime of iterated one-dimensional unimodal maps. We consider the scaling behavior in a modified tree which takes into account the self-similarity of the window structure. A nonuniversal geometric convergence of the associated superstable parameter values towards a Misiurewicz point is observed for almost all binary sequences with periodic tails. For these sequences the window period grows arithmetically down the binary tree. There are an infinite number of exceptional sequences, however, for which the growth of the window period is faster. Numerical studies with a quadratic maximum suggest more rapid than geometric scaling of the superstable parameter values for such sequences.     

Liénard系统无穷边值问题解的存在性

讨论Lienard系统无穷边值问题单调解和非单调解的存在性。利用平面动力系统理论,通过对称变换或拟对称变换比较系统所定义的向量场并构造系统的不变区域,以此证明系统连结轨道的存在性,获得边值问题解存在的一系列充分条件。特别地,当源函数为双稳函数时,系统存在无穷多单调解。     

Connected (g,f)‐factors

The vertex set of the reduced Kneser graph KG₂(m,2) consists of all pairs {a,b} such that a, bε{1,2,…,m} and 2≤|a?b|≤m?2. Two vertices are defined to be adjacent if they are disjoint. We prove that, if m≥4 and m≠5, then the circular chromatic number of KG₂(m,2) is equal to m?2, its ordinary chromatic number. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 62–68, 2002     

利用分支定界法解决MPS任务分配问题

应用简单的判定树法进行ＭＰＳ任务分配，其结果一般不是最佳的。本文使用分支定界法解决该问题。使得多处理机系统的负载均衡，任务并行程度，运行效率，资源利用率和降低不同处理机间的进程通信开销等方面的综合性能达到最优。     

度约束最小生成树的快速算法

本文对带有顶点度约束的最小生成树问题，给出了一种快速近似算法，并在微机上予以实现，经大量试算，效果良好。