Results 51 to 60 of about 841,975 (192)

Construction of discrete-time model for port-controlled Hamiltonian systems with applications [PDF]

, 2006
The issues of constructing a discrete-time model for Hamiltonian systems are in general different from those for dissipative systems. We propose an algorithm for constructing an approximate discrete-time model, which guarantees Hamiltonian conservation ...
Astolfi, A.,, Laila, Dina Shona, Astolfi, A., Astolfi, Alessandro, Laila, Dina Shona,   +4 more
core   +1 more source

On pedigree polytopes and Hamiltonian cycles

Discrete Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +5 more sources

On the existence of Hamiltonian cycles in hypercubes [PDF]

Notes on Number Theory and Discrete Mathematics
Building on the results of our previous work on Euclidean leaper tours, considering all integers k>1 and h>0, we study the existence of Hamiltonian cycles in the vertex set C(2,k):={0,1}ᵏ of the k-dimensional hypercube when the Euclidean distance between
Gabriele Di Pietro, Marco Ripà
doaj   +1 more source

Symmetry classes of Hamiltonian cycles

CoRR
27 pages, 13 ...
Júlia Baligács, Sofia Brenner, Annette Lutz, Lena Volk   +3 more
openaire   +4 more sources

Edge-Disjoint Hamiltonian Cycles in De Bruijn Graphs [PDF]

The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn graphs using ideas from finite field theory, particularly linear recurring sequences.
Lytle, Megan E.
core   +6 more sources

Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles

Electronic Journal of Graph Theory and Applications, 2016
A constructive method is provided that outputs a directed graph which is named a broken crown graph, containing $5n-9$ vertices and $k$ Hamiltonian cycles for any choice of integers $n \geq k \geq 4$. The construction is not designed to be minimal in any
Michael Haythorpe
doaj   +1 more source

Hamiltonian cycles and travelling salesfolk

International Journal of Science and Research (IJSR), 2023
A method is given in this paper that makes it easier to solve both the Hamiltonian cycle problem and the travelling salesman problem in any number of space dimensions and in both their directed and undirected varieties.
openaire   +1 more source

Oriented Hamiltonian Cycles in Tournaments

Journal of Combinatorial Theory, Series B, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Equivariant singularity theory with distinguished parameters: Two case studies of resonant Hamiltonian systems [PDF]

, 1998
We consider Hamiltonian systems near equilibrium that can be (formally) reduced to one degree of freedom. Spatio-temporal symmetries play a key role. The planar reduction is studied by equivariant singularity theory with distinguished parameters.
Vegter, G, Lunter, Gerard, Lunter, G.A; id_orcid, Vegter, G., G. A. Lunter, Vegter, G.,, Broer, H.W., Vegter, G.; id_orcid, Broer, H.W.,, Broer, H.W.; id_orcid, Lunter, G.A, Lunter, GA, H. W. Broer, G. Vegter, Lunter, G.A.,, Broer, HW   +15 more
core   +1 more source

Hamiltonicity of doubly semi-equivelar maps on the torus

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
There are 22 types of doubly semi-equivelar maps, with curvature 0, on the plane which provide infinitely many doubly semi-equivelar maps of respective types on the torus.
Singh Yogendra, Tiwari Anand Kumar, Kushwaha Seema   +2 more
doaj   +1 more source