Results 81 to 90 of about 2,059,443 (151)
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., +4 more
core +1 more source
On pre-Hamiltonian Cycles in Hamiltonian Digraphs [PDF]
, 2014 Let $D$ be a strongly connected directed graph of order $n\geq 4$. In \cite{[14]} (J. of Graph Theory, Vol.16, No. 5, 51-59, 1992) Y. Manoussakis proved the following theorem: Suppose that $D$ satisfies the following condition for every triple $x,y,z$ of vertices such that $x$ and $y$ are non-adjacent: If there is no arc from $x$ to $z$, then $d(x)+d(y)
openaire +2 more sources
Local properties of graphs that induce global cycle properties [PDF]
Opuscula MathematicaA graph \(G\) is locally Hamiltonian if \(G[N(v)]\) is Hamiltonian for every vertex \(v\in V(G)\). In this note, we prove that every locally Hamiltonian graph with maximum degree at least \(|V(G)| - 7\) is weakly pancyclic.
Yanyan Wang, Xiaojing Yang
doaj +1 more source
Cyclic near-Hamiltonian cycle decomposition of 2-fold complete graph
, 2019 In this paper, we formulate the existence of cyclic near-Hamiltonian cycle decomposition of 2Kv, for each odd v > 3. Moreover, a graphical representation for constructing a base cycle for such cyclic near-Hamiltonian cycle decomposition is presented ...
Ibrahim, Haslinda +5 more
core +1 more source
Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs
Discussiones Mathematicae Graph Theory, 2018 Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of D, then D is a semicomplete digraph. A digraph D is locally semicomplete if for every vertex x, the out-neighbours of x induce a semicomplete digraph and ...
Li Ruijuan, Han Tingting
doaj +1 more source
Distributing Vertices Carefully on a Hamiltonian Cycle
, 2011 Given a graph with sufficient minimum degree, the results contained in this work produce a Hamiltonian cycle on which specified vertices are placed at approximately prescribed intervals along the cycle.
Magnant, Colton
core +1 more source
Multicolored parallelisms of Hamiltonian cycles
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hung-Lin Fu, Yuan-Hsun Lo
openaire +2 more sources
Lower Bound on the Number of Hamiltonian Cycles of Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2020 In this paper, we investigate the number of Hamiltonian cycles of a generalized Petersen graph P (N, k) and prove that Ψ(P(N,3))⩾N⋅αN,\Psi ( {P ( {N,3} )} ) \ge N \cdot {\alpha _N}, where Ψ(P(N, 3)) is the number of Hamiltonian cycles of P(N, 3) and αN ...
Lu Weihua, Yang Chao, Ren Han
doaj +1 more source
On the parallel complexity of the alternating Hamiltonian cycle problem
, 2002 Given a graph with colored edges, a Hamiltonian cycle is called alternating if its successive edges differ in color. The problem of finding such a cycle, even for 2-edge-colored graphs, is trivially NP-complete, while it is known to be polynomial for 2 ...
Y. Manoussakis, I. Milis, E. Bampis
core +1 more source
On the existence of Hamiltonian cycles in hypercubes [PDF]
Notes on Number Theory and Discrete MathematicsBuilding 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