A note on hamiltonian 2-groups
R. A. Bryce, John Cossey (1991)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
R. A. Bryce, John Cossey (1991)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Reinhold Baer (1939)
Compositio Mathematica
Similarity:
Boris Khesin (1993)
Recherche Coopérative sur Programme n°25
Similarity:
E. Zenhder (1975)
Publications mathématiques et informatique de Rennes
Similarity:
Gary Chartrand, S. F. Kapoor (1974)
Colloquium Mathematicae
Similarity:
Demovič, A. (1995)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
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...
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...
Henryk Żołądek (2011)
Banach Center Publications
Similarity:
The first and the second Painlevé equations are explicitly Hamiltonian with time dependent Hamilton function. By a natural extension of the phase space one gets corresponding autonomous Hamiltonian systems in ℂ⁴. We prove that the latter systems do not have any additional algebraic first integral. In the proof equations in variations with respect to a parameter are used.
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...
Praught, Jeffery, Smirnov, Roman G. (2005)
SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]
Similarity:
D. Z. Du, D. F. Hsu (1989)
Banach Center Publications
Similarity:
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...