Results 31 to 40 of about 889,165 (240)
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
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
Hamiltonian and Variational Linear Distributed Systems [PDF]
, 2002 We use the formalism of bilinear- and quadratic differential forms in order to study Hamiltonian and variational linear distributed systems. It was shown in [1] that a system described by ordinary linear constant-coefficient differential equations is ...
Rapisarda, Paolo, Trentelman, Harry L.
core +2 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
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
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
The One-Fault Directed Dimension-Balanced Hamiltonian Problem in Directed Toroidal Mesh Graphs
Applied SciencesHamiltonian cycle problems play a central role in graph theory and have wide-ranging applications in network-on-chip architectures, interconnection networks, and large-scale parallel systems.
Yancy Yu-Chen Chang, Justie Su-Tzu Juan
doaj +1 more source
On vertices enforcing a Hamiltonian cycle
Discussiones Mathematicae Graph Theory, 2013 A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian. The H-force number h(G) of a graph G is defined to be the smallest cardinality of an H-force set of G.
Igor Fabrici +2 more
openaire +2 more sources
A Theorem on Even Pancyclic Bipartite Digraphs
Mathematical Problems of Computer Science, 2021 We prove a Meyniel-type condition and a Bang-Jensen, Gutin and Li-type condition for a strongly connected balanced bipartite digraph to be even pancyclic. Let D be a balanced bipartite digraph of order 2a ≥ 6.
Samvel Kh. Darbinyan
doaj +1 more source