Results 71 to 80 of about 841,975 (192)
Grafos hamiltonianos en el diseño de viajes
Modelling in Science Education and Learning, 2013 The existence and, if applicable, the location of paths with given properties is a topic in graph theory. One of these problems is to find routes through all points, only once, starting and ending at the same node.
Cristina Jordán Lluch +1 more
doaj +1 more source
Identifying Hamilton cycles in the Cartesian product of directed cycles
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a Cartesian product of directed cycles. It is known that has a Hamilton cycle if there is a permutation of that satisfies and for some positive integers , where . In addition, if then has two arc-disjoint Hamilton cycles.
Zbigniew R. Bogdanowicz
doaj +1 more source
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture. [PDF]
J Graph Theory, 2021 Bagheri Gh B +3 more
europepmc +1 more source
An Implicit Weighted Degree Condition For Heavy Cycles
Discussiones Mathematicae Graph Theory, 2014 For a vertex v in a weighted graph G, idw(v) denotes the implicit weighted degree of v. In this paper, we obtain the following result: Let G be a 2-connected weighted graph which satisfies the following conditions: (a) The implicit weighted degree sum of
Cai Junqing, Li Hao, Ning Wantao
doaj +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
Hamiltonian cycles in random regular graphs [PDF]
, 1984 The existence of Hamiltonian cycles in random vertex-labelled regular graphs is investigated. It is proved that there exists r0≤796 such that for r≥r0 almost all vertex-labelled r-regular graphs with n vertices have Hamiltonian cycles as n → ∞
Frieze, A.M. +3 more
core +1 more source
The S-Hamiltonian Cycle Problem
CoRRDetermining if an input undirected graph is Hamiltonian, i.e., if it has a cycle that visits every vertex exactly once, is one of the most famous NP-complete problems. We consider the following generalization of Hamiltonian cycles: for a fixed set $S$ of natural numbers, we want to visit each vertex of a graph $G$ exactly once and ensure that any two ...
Amarilli, Antoine +2 more
openaire +4 more sources
QAOA on Hamiltonian Cycle problem
CoRR, 2023 I use QAOA to solve the Hamiltonian Circle problem. First, inspired by Lucas, I define the QUBO form of Hamiltonian Cycle and transform it to a quantum circuit by embedding the problem of $n$ vertices to an encoding of $(n-1)^2$ qubits. Then, I calcluate the spectrum of the cost hamiltonian for both triangle case and square case and justify my ...
openaire +3 more sources
Hamiltonian PDEs: new connections between dynamical systems and PDEs with small divisors phenomena
, 2008 Many partial differential equations arising in physics can be seen as infinite dimensional Hamiltonian systems. Main examples are the nonlinear wave equation, the nonlinear Schrödinger equation, the beam, the membrane and the Kirkhoff equations in ...
BERTI, MASSIMILIANO
core
A note on edge-disjoint contractible Hamiltonian cycles in polyhedral maps
Electronic Journal of Graph Theory and Applications, 2014 We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamiltonian Cycles in the edge graph of polyhedral maps.
Ashish K Upadhyay, Dipendu Maity
doaj +1 more source