Results 31 to 40 of about 55,873 (316)
Extending Complex Conjugate Control to Nonlinear Wave Energy Converters
Journal of Marine Science and Engineering, 2020 This paper extends the concept of Complex Conjugate Control (CCC) of linear wave energy converters (WECs) to nonlinear WECs by designing optimal limit cycles with Hamiltonian Surface Shaping and Power Flow Control (HSSPFC).
David G. Wilson +4 more
doaj +1 more source
On a computer-aided approach to the computation of Abelian integrals [PDF]
, 2011 An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems.
A. Neumaier +27 more
core +2 more sources
A note on equitable Hamiltonian cycles
Discrete Applied Mathematics, 2021 Given a complete graph with an even number of vertices, and with each edge colored with one of two colors (say red or blue), an equitable Hamiltonian cycle is a Hamiltonian cycle that can be decomposed into two perfect matchings such that both perfect matchings have the same number of red edges.
Tim Ophelders +3 more
openaire +2 more sources
Moroccan Journal of Pure and Applied Analysis, 2021 The main goal of this paper is to provide the maximum number of crossing limit cycles of two different families of discontinuous piecewise linear differential systems.
Damene Loubna, Benterki Rebiha
doaj +1 more source
On Hamiltonian alternating cycles and paths
Computational Geometry, 2018 We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax the constraint on the cycles and paths from being plane to being 1-plane, and deal with the same ...
Claverol Aguas, Mercè +4 more
openaire +7 more sources
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
Types of triangle in plane Hamiltonian triangulations and applications to domination and k-walks [PDF]
, 2019 We investigate the minimum number t(0)(G) of faces in a Hamiltonian triangulation G so that any Hamiltonian cycle C of G has at least t(0)(G) faces that do not contain an edge of C.
Brinkmann, Gunnar +2 more
core +2 more sources
Contractible Hamiltonian Cycles in Polyhedral Maps [PDF]
, 2012 We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles.
Maity, Dipendu, Upadhyay, Ashish Kumar
core +1 more source
The Parity of Directed Hamiltonian Cycles [PDF]
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n) expected time algorithm. Our algorithms are based on a new combinatorial formula for the number of Hamiltonian cycles modulo a ...
Björklund, Andreas, Husfeldt, Thore
openaire +3 more sources
Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes [PDF]
Journal of Combinatorial Theory, Series B, 2021 We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a complete rank, or, equivalently, of size $1 + {{n-1} \choose d}$.
Rogers Mathew +3 more
openaire +4 more sources