Displaying similar documents to “A simple proof of the non-integrability of the first and the second Painlevé equations”

Improved Sufficient Conditions for Hamiltonian Properties

Jens-P. Bode, Anika Fricke, Arnfried Kemnitz (2015)

Discussiones Mathematicae Graph Theory

Similarity:

In 1980 Bondy [2] proved that a (k+s)-connected graph of order n ≥ 3 is traceable (s = −1) or Hamiltonian (s = 0) or Hamiltonian-connected (s = 1) if the degree sum of every set of k+1 pairwise nonadjacent vertices is at least ((k+1)(n+s−1)+1)/2. It is shown in [1] that one can allow exceptional (k+ 1)-sets violating this condition and still implying the considered Hamiltonian property. In this note we generalize this result for s = −1 and s = 0 and graphs that fulfill a certain connectivity...

Andrew Lenard: a mystery unraveled.

Praught, Jeffery, Smirnov, Roman G. (2005)

SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]

Similarity:

A note on the Song-Zhang theorem for Hamiltonian graphs

Kewen Zhao, Ronald J. Gould (2010)

Colloquium Mathematicae

Similarity:

An independent set S of a graph G is said to be essential if S has a pair of vertices that are distance two apart in G. In 1994, Song and Zhang proved that if for each independent set S of cardinality k+1, one of the following condition holds: (i) there exist u ≠ v ∈ S such that d(u) + d(v) ≥ n or |N(u) ∩ N(v)| ≥ α (G); (ii) for any distinct u and v in S, |N(u) ∪ N(v)| ≥ n - max{d(x): x ∈ S}, then G is Hamiltonian. We prove that if for each...

Output synchronization of multi-agent port-Hamiltonian systems with link dynamics

Bing Wang, Xinghu Wang, Honghua Wang (2016)

Kybernetika

Similarity:

In this paper, the output synchronization control is considered for multi-agent port-Hamiltonian systems with link dynamics. By using Hamiltonian energy function and Casimir function comprehensively, the design method is proposed to overcome the difficulties taken by link dynamics. The Hamiltonian function is used to handle the dynamic of agent, while the Casimir function is constructed to deal with the dynamic of link. Thus the Lyapunov function is generated by modifying the Hamiltonian...

On the Edge-Hyper-Hamiltonian Laceability of Balanced Hypercubes

Jianxiang Cao, Minyong Shi, Lihua Feng (2016)

Discussiones Mathematicae Graph Theory

Similarity:

The balanced hypercube BHn, defined by Wu and Huang, is a variant of the hypercube network Qn, and has been proved to have better properties than Qn with the same number of links and processors. For a bipartite graph G = (V0 ∪ V1,E), we say G is edge-hyper-Hamiltonian laceable if it is Hamiltonian laceable, and for any vertex v ∈ Vi, i ∈ {0, 1}, any edge e ∈ E(G − v), there is a Hamiltonian path containing e in G − v between any two vertices of V1−i. In this paper, we prove that BHn...

Generalized Hamiltonian dynamics after Dirac and Tulczyjew

Fiorella Barone, Renato Grassini (2003)

Banach Center Publications

Similarity:

Dirac's generalized Hamiltonian dynamics is given an accurate geometric formulation as an implicit differential equation and is compared with Tulczyjew's formulation of dynamics. From the comparison it follows that Dirac's equation-unlike Tulczyjew's-fails to give a complete picture of the real laws of classical and relativistic dynamics.

Modulation of the Camassa-Holm equation and reciprocal transformations

Simonetta Abenda, Tamara Grava (2005)

Annales de l’institut Fourier

Similarity:

We derive the modulation equations (Whitham equations) for the Camassa-Holm (CH) equation. We show that the modulation equations are hyperbolic and admit a bi-Hamiltonian structure. Furthermore they are connected by a reciprocal transformation to the modulation equations of the first negative flow of the Korteweg de Vries (KdV) equation. The reciprocal transformation is generated by the Casimir of the second Poisson bracket of the KdV averaged flow. We show that...