Results 31 to 40 of about 841,975 (192)
The parity Hamiltonian cycle problem
Discrete Mathematics, 2018 Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that the walk may use an edge more than once. First, we give a complete characterization of the graphs which have PHCs,
Hiroshi Nishiyama +4 more
openaire +3 more sources
Partitioning 3-colored complete graphs into three monochromatic cycles [PDF]
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core +1 more source
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
Controlled Lagrangian and Hamiltonian Systems [PDF]
, 2002 any control systems are mechanical systems. The unique feature of mechanical systems is the notion of energy, which gives much information on the stability of equilibria.
Chang, Dong Eui
core +1 more source
, 2021 If the line graph of a graph $G$ decomposes into Hamiltonian cycles, what is $G$?
Zaslavsky, Thomas, Sivaraman, Vaidy
core +1 more source
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
A Finite Dimensional Approximation of the shallow water Equations: The port-Hamiltonian Approach [PDF]
, 2006 We look into the problem of approximating a distributed parameter port-Hamiltonian system which is represented by a non-constant Stokes-Dirac structure.
Ramkrishna Pasumarthy, R.P. +8 more
core +4 more sources
Removable matchings and hamiltonian cycles
Discrete Mathematics, 2009 The authors show the following two results: {\parindent=5mm \begin{itemize}\item[1)]Let \(G\) be a graph of order \(n\geq 4k+3\) with \(\sigma_2 (G)\geq n\) and let \(F\) be a matching of size \(k\) in \(G\) such that \(G-F\) is 2-connected. Then \(G-F\) is hamiltonian or \(G\cong K_2 +(K_2\cup K_{n-4})\) or \(G\cong \bar{K_2} +(K_2\cup K_{n-4 ...
Zhiquan Hu, Hao Li
openaire +1 more source
Hamiltonian cycles in polyhedral maps [PDF]
Proceedings - Mathematical Sciences, 2017 14 ...
Maity, Dipendu, Upadhyay, Ashish Kumar
openaire +2 more sources
On Factorization, Interconnection and Reduction of Collocated Port-Hamiltonian Systems [PDF]
, 2004 Based on a geometric interpretation of nonlinear balanced reduction some implications of this approach are analyzed in the case of collocated port-Hamiltonian systems which have a certain balance in its structure.
Ricardo Lopezlena +6 more
core +1 more source