排序方式: 共有16条查询结果,搜索用时 15 毫秒
1.
2.
3.
We established sufficient conditions for the global attractivity of the positive equilibrium of the delay differential equation [Ndot](t) ≡ ?δN(t) + PN(t–τ)e?aN(t–τ) which was used by Gurney, Blythe and Nisbet [1] in describing the dynamics of Nicholson's blowflies 相似文献
4.
Oscillation criteria for delay equations 总被引:1,自引:0,他引:1
M. Kon Y. G. Sficas I. P. Stavroulakis 《Proceedings of the American Mathematical Society》2000,128(10):2989-2997
This paper is concerned with the oscillatory behavior of first-order delay differential equations of the form
(1) |
where is non-decreasing, for and . Let the numbers and be defined by
It is proved here that when and all solutions of Eq. (1) oscillate in several cases in which the condition
2k+\frac{2}{{\lambda}_{1}}-1 \end{displaymath}">
holds, where is the smaller root of the equation .
5.
6.
7.
M.K Grammatikopoulos Y.G Sficas V.A Staikos 《Journal of Mathematical Analysis and Applications》1979,67(1):171-187
We regard a graph G as a set {1,…, v} together with a nonempty set E of two-element subsets of {1,…, v}. Let p = (p1,…, pv) be an element of nv representing v points in n and consider the realization G(p) of G in n consisting of the line segments [pi, pj] in n for {i, j} ?E. The figure G(p) is said to be rigid in n if every continuous path in nv, beginning at p and preserving the edge lengths of G(p), terminates at a point q ? nv which is the image (Tp1,…, Tpv) of p under an isometry T of n. We here study the rigidity and infinitesimal rigidity of graphs, surfaces, and more general structures. A graph theoretic method for determining the rigidity of graphs in 2 is discussed, followed by an examination of the rigidity of convex polyhedral surfaces in 3. 相似文献
8.
9.
10.