Related papers: Chaos and periodicity on star graphs
The motion of stars in the gravitational potential of a triaxial galaxy is generically chaotic. However, the timescale over which the chaos manifests itself in the orbital motion is a strong function of the degree of central concentration…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…
Let $X$ be a Stein manifold of dimension $n\geq 2$ satisfying the volume density property with respect to an exact holomorphic volume form. For example, $X$ could be $\mathbb{C}^n$, any connected linear algebraic group that is not…
We prove that the spectrum of an individual chaotic quantum graph shows universal spectral correlations, as predicted by random--matrix theory. The stability of these correlations with regard to non--universal corrections is analyzed in…
We modify the Pearce-Kelly algorithm that maintains a topological ordering for a directed acyclic graph in order to allow cycles to be tolerated. Cycles make topological orderings moot, of course, however tolerating them is useful in…
Answers are offered to the Gould's question to find spectral sufficient conditions for a graph to have a chorded cycle via signless Laplacian spectral radius. The conditions are tight.
The existing periodic orbit theory of spectral correlations for classically chaotic systems relies on the Riemann-Siegel-like representation of the spectral determinants which is still largely hypothetical. We suggest a simpler derivation…
We present a new sufficient condition on stability number and toughness of the graph to have an f-factor.
In this article we prove that for a diffeomorphism on a compact Riemannian manifold, if there is a nontrival homoclinic class that is not uniformly hyperbolic or the diffeomorphism is a $C^{1+\alpha}$ and there is a hyperbolic ergodic…
A graph $X$ is said to be unstable if the direct product $X\times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is non-trivially unstable if it is…
We give a sufficient and necessary condition for a Praeger-Xu graph to be a Cayley graph.
Grebogi, Ott and Yorke (Phys. Rev. A 38(7), 1988) have investigated the effect of finite precision on average period length of chaotic maps. They showed that the average length of periodic orbits ($T$) of a dynamical system scales as a…
In this paper we provide a sufficient condition for the linear instability of a periodic orbit for a free period Lagrangian system on a Riemannian manifold. The main result establish a general criterion for the linear instability of a maybe…
A Hamilton cycle is a cycle containing every vertex of a graph. A graph is called Hamiltonian if it contains a Hamilton cycle. The Hamilton cycle problem is to find the sufficient and necessary condition that a graph is Hamiltonian. In this…
In this paper we investigate the iteration problem for several chaos in non-autonomous discrete system. Firstly, we prove that the Li-Yorke chaos of a non-autonomous discrete dynamical system is preserved under iterations when…
Phase mixing of chaotic orbits exponentially distributes these orbits through their accessible phase space. This phenomenon, commonly called ``chaotic mixing'', stands in marked contrast to phase mixing of regular orbits which proceeds as a…
A biclique of a graph $G$ is an induced complete bipartite subgraph of $G$ such that neither part is empty. A star is a biclique of $G$ such that one part has exactly one vertex. The star graph of $G$ is the intersection graph of the…
In the present work we consider a diatomic granular crystal, consisting of alternating aluminum and steel spheres, where the first sphere is an aluminum one. The combination of dissipation, driving of the boundary, and intrinsic…
A set of quantum states, dynamically related to the classical periodic orbits of a chaotic map, is used as a basis in which the description of the eigenstates of its quantum version is greatly simplified. This set can be improved with the…
We conclude an investigation of Abrishami, Esperet, Giocanti, Hamman, Knappe and M\"oller studying the existence of periodic colourings of locally finite graphs. A colouring of a graph $\Gamma$ is periodic if the resulting coloured graph…