Results 91 to 100 of about 841,975 (192)

Change in Hamiltonian General Relativity from the Lack of a Time-like Killing Vector Field [PDF]

, 2013
In General Relativity in Hamiltonian form, change has seemed to be missing, defined only asymptotically, or otherwise obscured at best, because the Hamiltonian is a sum of first-class constraints and a boundary term and thus supposedly generates gauge ...
Pitts, J. Brian, J. Brian Pitts
core  

Ghost sign for Sid Mottram Cycles on the corner of Wolverton Road and Narborough Road, 2023.

, 2023
Ghost sign for Sid Mottram Cycles made up of two parts. On the left, the sign reads 'Sid Mottram / Racing & Touring Cycles', and on the right, the sign reads 'Falcon. Dawes. Holdsworth. Claud Butler. Sun & Raleigh Cycles'.
Hyde, Colin
core  

Discrete exterior geometry approach to structure-preserving discretization of distributed-parameter port-Hamiltonian systems [PDF]

, 2011
This paper addresses the issue of structure-preserving discretization of open distributed-parameter systems with Hamiltonian dynamics. Employing the formalism of discrete exterior calculus, we introduce a simplicial Dirac structure as a discrete analogue
Seslija, Marko,, Scherpen, Jacquelien M.A.,, van der Schaft, Abraham, van der Schaft, Abraham; id_orcid, Arjan Van Der Schaft, Jacquelien M. A. Scherpen, van der Schaft, Arjan, Scherpen, Jacquelien M.A., Seslija, Marko, van der Schaft, Arjan ; id_orcid, Marko Seslija, Schaft, Arjan van der,   +11 more
core   +3 more sources

Counting Hamiltonian cycles in quartic circulant graphs [PDF]

We consider the problem of counting Hamiltonian cycles in circulant graphs $C_n^{1,k}$. Our method is to partition the set of Hamiltonian cycles according to their winding numbers.
Hilliard, Allison
core  

Operadic structure on Hamiltonian paths and cycles [PDF]

We study Hamiltonian paths and cycles in undirected graphs from an operadic viewpoint. We show that the graphical collection $\mathsf{Ham}$ encoding directed Hamiltonian paths in connected graphs admits an operad-like structure, called a contractad ...
Lyskov, Denis
core   +1 more source

On the number of Hamiltonian cycles in tournaments

Discrete Mathematics, 1980
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tournament of order n and the minimum number of Hamiltonian cycles in a 2-connected tournament of order n increase exponentially with n. Furthermore, the number of Hamiltonian cycles in a tournament increases at least exponentially with the minimum outdegree of ...
openaire   +3 more sources

On the Number of Hamiltonian Cycles in Bipartite Graphs

, 1996
We prove that a bipartite uniquely Hamiltonian graph has a vertex of degree 2 in each color class. As consequences, every bipartite Hamiltonian graph of minimum degree d has at least 21-dd!
Thomassen, Carsten
core   +1 more source

Hamiltonian Cycles in Regular Graphs

, 1978
This chapter presents the theorem of Hamiltonian cycles in regular graphs. If in a graph of order n every vertex has degree at least 1/2n then the graph contains a Hamiltonian cycle. This theorem is the first in a long line of results concerning forcibly
Béla Bollobás, Arthur Hobbs, Bollobás, Béla, Hobbs, Arthur   +3 more
core   +1 more source

Long Cycles in Chromatic Digraphs Spanned by Hamiltonian Directed Paths

Mathematics
Let C be any oriented cycle on n vertices. We show that every (10n−4)-chromatic digraph spanned by a Hamiltonian directed path contains a subdivision of C.
Salman Ghazal, Nadine Dirani
doaj   +1 more source

Edge-disjoint Hamiltonian cycles in two-dimensional torus

International Journal of Mathematics and Mathematical Sciences, 2004
Myung M. Bae, Bader F. Albdaiwi, Bella Bose   +2 more
doaj   +1 more source