On the number of independent chorded cycles in a graph

Hajnal and Corrádi proved that any simple graph on at least 3k vertices with minimal degree at least 2k contains k independent cycles. We prove the analogous result for chorded cycles. Let G be a simple graph with |V(G)|4k and minimal degree δ(G)3k. Then G contains k independent chorded cycles. This result is sharp.     

Estimating the number of limit cycles in polynomials systems

We describe a method based on algorithms of computational algebra for obtaining an upper bound for the number of limit cycles bifurcating from a center or a focus of polynomial vector field. We apply it to a cubic system depending on six parameters and prove that in the generic case at most six limit cycles can bifurcate from any center or focus at the origin of the system.     

On the number of cycles in local tournaments

A digraph without loops, multiple arcs and directed cycles of length two is called a local tournament if the set of in-neighbors as well as the set of out-neighbors of every vertex induces a tournament. A vertex of a strongly connected digraph is called a non-separating vertex if its removal preserves the strong connectivity of the digraph in question.In 1990, Bang-Jensen showed that a strongly connected local tournament does not have any non-separating vertices if and only if it is a directed cycle. Guo and Volkmann extended this result in 1994. They determined the strongly connected local tournament with exactly one non-separating vertex. In the first part of this paper we characterize the class of strongly connected local tournaments with exactly two non-separating vertices.In the second part of the paper we consider the following problem: Given a strongly connected local tournament D of order n with at least n+2 arcs and an integer 3≤r≤n. How many directed cycles of length r exist in D? For tournaments this problem was treated by Moon in 1966 and Las Vergnas in 1975. A reformulation of the results of the first part shows that we have characterized the class of strongly connected local tournaments with exactly two directed cycles of length n−1. Among other things we show that D has at least n−r+1 directed cycles of length r for 4≤r≤n−1 unless it has a special structure. Moreover, we characterize the class of local tournaments with exactly n−r+1 directed cycles of length r for 4≤r≤n−1 which generalizes a result of Las Vergnas.     

On the maximum number of cycles in a planar graph

Let G be a graph on p vertices with q edges and let r = q ? p = 1. We show that G has at most cycles. We also show that if G is planar, then G has at most 2^{r ? 1} = o(2^{r ? 1}) cycles. The planar result is best possible in the sense that any prism, that is, the Cartesian product of a cycle and a path with one edge, has more than 2^{r ? 1} cycles. © Wiley Periodicals, Inc. J. Graph Theory 57: 255–264, 2008     

On the number of limit cycles in double homoclinic bifurcations

LetL be a double homoclinic loop of a Hamiltonian system on the plane. We obtain a condition under whichL generates at most two large limit cycles by perturbations. We also give conditions for the existence of at most five or six limit cycles which appear nearL under perturbations.     

Bounding the number of cycles in a graph in terms of its degree sequence

We give an upper bound on the number of cycles in a simple graph in terms of its degree sequence, and apply this bound to resolve several conjectures of Király (2009) and Arman and Tsaturian (2017) and to improve upper bounds on the maximum number of cycles in a planar graph.     

Lower bounds for the number of limit cycles of trigonometric Abel equations

We consider the Abel equation , where A(t) and B(t) are trigonometric polynomials of degree n and m, respectively, and we give lower bounds for its number of isolated periodic orbits for some values of n and m. These lower bounds are obtained by two different methods: the study of the perturbations of some Abel equations having a continuum of periodic orbits and the Hopf-type bifurcation of periodic orbits from the solution x=0.     

Hamilton cycles in circulant digraphs with prescribed number of distinct jumps

Let G be a digraph that consists of a finite set of vertices V(G). G is called a circulant digraph if its automorphism group contains a |V(G)|-cycle. A circulant digraph G has arcs incident to each vertex i, where integers a_ks satisfy 0<a₁<a₂<a_j≤|V(G)|−1 and are called jumps. It is well known that not every G is Hamiltonian. In this paper we give sufficient conditions for a G to have a Hamilton cycle with prescribed distinct jumps, and prove that such conditions are also necessary for every G with two distinct jumps. Finally, we derive several results for obtaining G^′ with k, k≥2 distinct jumps if the corresponding G contains a Hamilton cycle with two distinct jumps.     

Comparing numerical methods for stiff systems of O.D.E:s

This paper describes a technique for comparing numerical methods that have been designed to solve stiff systems of ordinary differential equations. The basis of a fair comparison is discussed in detail. Measurements of cost and reliability are made over a collection of 25 carefully selected problems. The problems have been designed to show how certain major factors affect the performance of a method. The technique is applied to five methods, of which three turn out to be quite good, including one based on backward differentiation formulas, another on second derivative formulas, and a third on extrapolation. However, each of the three has a weakness of its own, which can be identified with particular problem characteristics.     

Existence of limit cycles in a tritrophic food chain model with Holling functional responses of type II and III

We are interested in the coexistence of three species forming a tritrophic food chain model. Considering a linear grow for the lowest trophic species, Holling III and Holling II functional response for the predator and the top‐predator, respectively. We prove that this model has stable periodic orbits for adequate values of its parameters. Copyright © 2016 John Wiley & Sons, Ltd.     

On the integration of stiff systems of O.D.E.s using extended backward differentiation formulae

Summary A class of extended backward differentiation formulae suitable for the approximate numerical integration of stiff systems of first order ordinary differential equations is derived. An algorithm is described whereby the required solution is predicted using a conventional backward differentiation scheme and then corrected using an extended backward differentiation scheme of higher order. This approach allows us to developL-stable schemes of order up to 4 andL()-stable schemes of order up to 9. An algorithm based on the integration formulae derived in this paper is illustrated by some numerical examples and it is shown that it is often superior to certain existing algorithms.     

A limit theorem for the Shannon capacities of odd cycles. II

It follows from a construction for independent sets in the powers of odd cycles given in the predecessor of this paper that the limit as goes to infinity of is zero, where is the Shannon capacity of a graph . This paper contains a shorter proof of this limit theorem that is based on an `expansion process' introduced in an older paper of L. Baumert, R. McEliece, E. Rodemich, H. Rumsey, R. Stanley and H. Taylor. We also refute a conjecture from that paper, using ideas from the predecessor of this paper.

     

Unbounded convex mappings of the ball in

In this paper, we study univalent holomorphic mappings of the unit ball in that have the property that the image contains a line for some , . We show that under certain rather reasonable conditions, up to composition with a holomorphic automorphism of the ball, the mapping is an extension of the strip mapping in the plane to higher dimensions.

     

On a class of cyclic methods for the numerical integration of stiff systems of O.D.E.s

A class of cyclic linear multistep methods suitable for the approximate numerical integration of stiff systems of first order ordinary differential equations is developed. Particular attention is paid to the problem of deriving schemes which are almostA-stable, self starting, have relatively high orders of accuracy and contain a built in error estimate. These requirements demand that the linear multistep methods which are used are solved iteratively rather than directly in the usual way and an efficient method for doing this is suggested. Finally the algorithms are illustrated by application to a particular test problem.     

Forced symmetry breaking of homoclinic cycles in a PDE with O(2) symmetry

We perform a numerical study of solutions near homoclinic orbits for forced symmetry breaking of a PDE with O(2) symmetry to one with SO(2) symmetry. Taking particular care of the consequences of the continuous group action, we concentrate on the Kuramoto-Sivashinsky equation with spatially periodic boundary conditions. The breakup of structurally stable homoclinic cycles is investigated via the introduction of flux term that breaks the reflectional symmetry while retaining the translational symmetry. In particular, we note that although Chossat (1993) has proved that generic perturbations cause the appearance of quasiperiodic orbits, for the simplest possible flux terms this is not the case. We compare these results with numerical simulations of a Galerkin approximation of the equations.     

Intertwined Basins of Attraction in Systems of O.D.E.

We investigate the basins of attraction in two dimensional ordinary differential equations (O.D.E.), and show that under certain conditions the basins of attraction are of fine and intertwined structure, which giving rise to an obstruction to predictability.     

A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs

Let $G$ be a balanced bipartite graph of order $2n\ge 4$, and let ${\sigma }_{1,1}\left(G\right)$ be the minimum degree sum of two non-adjacent vertices in different partite sets of $G$. In 1963, Moon and Moser proved that if ${\sigma }_{1,1}\left(G\right)\ge n+1$, then $G$ is hamiltonian. In this note, we show that if $k$ is a positive integer, then the Moon–Moser condition also implies the existence of a 2-factor with exactly $k$ cycles for sufficiently large graphs. In order to prove this, we also give a ${\sigma }_{1,1}$ condition for the existence of $k$ vertex-disjoint alternating cycles with respect to a chosen perfect matching in $G$.