Long properly coloured cycles in edge-coloured graphs

Let be an edge-coloured graph. The minimum colour degree of is the largest integer such that, for every vertex , there are at least distinct colours on edges incident to . We say that is properly coloured if no two adjacent edges have the same colour. In this paper, we show that, for any and large, every edge-coloured graph with contains a properly coloured cycle of length at least .     

The number and stability of limit cycles for planar piecewise linear systems of node–saddle type

The objective of this paper is to study the number and stability of limit cycles for planar piecewise linear (PWL) systems of node–saddle type with two linear regions. Firstly, we give a thorough analysis of limit cycles for Liénard PWL systems of this type, proving one is the maximum number of limit cycles and obtaining necessary and sufficient conditions for the existence and stability of a unique limit cycle. These conditions can be easily verified directly according to the parameters in the systems, and play an important role in giving birth to two limit cycles for general PWL systems. In this step, the tool of a Bendixon-like theorem is successfully employed to derive the existence of a limit cycle. Secondly, making use of the results gained in the first step, we obtain parameter regions where the general PWL systems have at least one, at least two and no limit cycles respectively. In addition for the general PWL systems, some sufficient conditions are presented for the existence and stability of a unique one and exactly two limit cycles respectively. Finally, some numerical examples are given to illustrate the results and especially to show the existence and stability of two nested limit cycles.     

6-圈至多含一弦平面图的线性荫度

线性森林是指每个连通分支都是路的图.图G的线性荫度la(G)等于将其边分解为k个边不交的线性森林的最小整数k.文中利用权转移方法证明了,若G是一个最大度大于等于7且每个6-圈至多含一条弦的平面图,则la(G)=「(△(G))/2」.     

Nonseparating Cycles Avoiding Specific Vertices

Thomassen proved that every ‐connected graph G contains an induced cycle C such that is k‐connected, establishing a conjecture of Lovász. In general, one could ask the following question: For any positive integers , does there exist a smallest positive integer such that for any ‐connected graph G, any with , and any , there is an induced cycle C in such that and is l‐connected? The case when is a well‐known conjecture of Lovász that is still open for . In this article, we prove and . We also consider a weaker version: For any positive integers , is there a smallest positive integer such that for every ‐connected graph G and any with , there is an induced cycle C in such that is l‐connected? The case when was studied by Thomassen. We prove and .     

Computing a closest bifurcation instability in multidimensional parameter space

Summary Engineering and physical systems are often modeled as nonlinear differential equations with a vector λ of parameters and operated at a stable equilibrium. However, as the parameters λ vary from some nominal value λ₀, the stability of the equilibrium can be lost in a saddle-node or Hopf bifurcation. The spatial relation in parameter space of λ₀ to the critical set of parameters at which the stable equilibrium bifurcates determines the robustness of the system stability to parameter variations and is important in applications. We propose computing a parameter vector λ_* at which the stable equilibrium bifurcates which is locally closest in parameter space to the nominal parameters λ₀. Iterative and direct methods for computing these locally closest bifurcations are described. The methods are extensions of standard, one-parameter methods of computing bifurcations and are based on formulas for the normal vector to hypersurfaces of the bifurcation set. Conditions on the hypersurface curvature are given to ensure the local convergence of the iterative method and the regularity of solutions of the direct method. Formulas are derived for the curvature of the saddle node bifurcation set. The methods are extended to transcritical and pitchfork bifurcations and parametrized maps, and the sensitivity to λ₀ of the distance to a closest bifurcation is derived. The application of the methods is illustrated by computing the proximity to the closest voltage collapse instability of a simple electric power system.     

Long cycles in graphs without hamiltonian paths

For a graph G, p(G) and c(G) denote the order of a longest path and a longest cycle of G, respectively. Bondy and Locke [J.A. Bondy, S.C. Locke, Relative length of paths and cycles in 3-connected graphs, Discrete Math. 33 (1981) 111-122] consider the gap between p(G) and c(G) in 3-connected graphs G. Starting with this result, there are many results appeared in this context, see [H. Enomoto, J. van den Heuvel, A. Kaneko, A. Saito, Relative length of long paths and cycles in graphs with large degree sums, J. Graph Theory 20 (1995) 213-225; M. Lu, H. Liu, F. Tian, Relative length of longest paths and cycles in graphs, Graphs Combin. 23 (2007) 433-443; K. Ozeki, M. Tsugaki, T. Yamashita, On relative length of longest paths and cycles, preprint; I. Schiermeyer, M. Tewes, Longest paths and longest cycles in graphs with large degree sums, Graphs Combin. 18 (2002) 633-643]. In this paper, we investigate graphs G with p(G)−c(G) at most 1 or at most 2, but with no hamiltonian paths. Let G be a 2-connected graph of order n, which has no hamiltonian paths. We show two results as follows: (i) if , then p(G)−c(G)≤1, and (ii) if σ₄(G)≥n+3, then p(G)−c(G)≤2.     

一类具功能反应的食饵-捕食者系统的定性分析

运用微分方程定性与稳定性分析的方法研究了一类食饵-捕食者系统的定性行为,讨论了该系统的平衡点的性态,给出了该系统极限环不存在性存在性的充分条件以及至多存在一个极限环的充分条件,从而补充和推广了前人已有的结果.     

Existence of Limit Cycles for a Cubic Kolmogorov System with a Hyperbolic Solution

When we discuss some problems in bio-mathematics,we often meet cubicKolmogorov systems.For general type of Kolmogorov systems,the qualitative analysisis very difficult. Usually,one discusses some special type of cubic Kolmogorovsystems,for example,cubic Kolmogorov systems with an algebraic curve solution.Firstly,the existence oflimitcycles fora cubic Kolmogorov system with quadratic curvesolution was studied.In article[1 ] ,though the author proved the cubic Kolmogorovsystem with a solution…     

金融危机传染的非线性动力学模型

越来越多的证据表明全球金融市场是高度复杂,广泛联接的非线性动力系统网络,由于系统的非线性和复杂性特征使得金融危机极易通过系统间的耦合作用而发生传染.针对金融危机传染所表现出的非线性动力学特性,本文构建了以传染源国家和受传染国家股票收益率为变量的微分动力学传染模型.利用微分方程定性理论对模型的奇点进行讨论,得出极限环存在的条件及形式,并进而得出金融危机传染的三种情况:轻度传染、可控传染和强烈传染.     

Schrijver图SG(2k+2,k)的Hamilton性

通过图G的每个顶点的路称为Hamilton路,通过图G的每个顶点的圈称为Hamilton圈,具有Hamilton圈的图G称为Hamilton图.1952年Dirac曾得到关于Hamilton图一个充分条件的结论:图G有n个顶点,如果每个顶点υ满足:d(υ)≥n/2,则图G是Hamilton图.本文研究了Schrijver图SG(2k+2,k)的Hamilton性,采用寻找Hamilton圈的方法得出了Schrijver图SG(2k+2,k)是Hamilton图.