Results 101 to 110 of about 2,059,443 (151)
Intuitionistic Fuzzy Hamiltonian Cycle by Index Matrices [PDF]
Annals of computer science and information systems, 2020 Velichka Traneva, Stoyan Tranev
doaj +1 more source
Perturbed hamiltonian-cycle-based algorithms to solve snake game
, 2023 The snake game is an old classical game with simple rules that, to this date, has yet been completely solved with in the most efficient manner. The concept of Hamiltonian cycle allows to solve the snake game with perfect completion rate, albeit in an ...
Chen, Leonardus
core
Placing Specified Vertices at Precise Locations on a Hamiltonian Cycle
, 2017 Sharp minimum degree and degree sum conditions are proven for the existence of a Hamiltonian cycle passing through specified vertices with prescribed distances between them in large ...
Nowbandegani, Pouria Salehi +2 more
core +1 more source
The Balanced Hamiltonian Cycle on the Toroidal Mesh Graphs
, 2012 The balanced Hamiltonian cycle problemis a quiet new topic of graph theorem. Given a graph G = (V, E), whose edge set can be partitioned into k dimensions, for positive integer k and a Hamiltonian cycle C on G.
Wen-Fang Peng, Justie Su-Tzu Juan
core +1 more source
Structural and Hamiltonian Properties of the n–Array Unit Graphs Over Finite Rings
مجلة بغداد للعلومConsider a finite ring R, and let U( R ) denote the set of all its unit elements. The unit graph G_R of R is defined as follows: the vertex set V( G_R ) consists of all elements of R.
Puguh Wahyu Prasetyo +2 more
doaj +1 more source
Graphs with Many Hamiltonian Paths
, 2023 A graph is hamiltonian-connected if every pair of vertices can be connected by a hamiltonian path, and it is hamiltonian if it contains a hamiltonian cycle. Every hamiltonian-connected graph is hamiltonian.
Zhang, Xingyi +4 more
core
On the number of Hamiltonian cycles in tournaments
Discrete Mathematics, 1980 AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tournament of order n and the minimum number of Hamiltonian cycles in a 2-connected tournament of order n increase exponentially with n. Furthermore, the number of Hamiltonian cycles in a tournament increases at least exponentially with the minimum outdegree of ...
openaire +3 more sources
Change in Hamiltonian General Relativity from the Lack of a Time-like Killing Vector Field [PDF]
, 2013 In General Relativity in Hamiltonian form, change has seemed to be missing, defined only asymptotically, or otherwise obscured at best, because the Hamiltonian is a sum of first-class constraints and a boundary term and thus supposedly generates gauge ...
Pitts, J. Brian, J. Brian Pitts
core
THE COMPLEXITY OF THOMASON’S ALGORITHM FOR FINDING A SECOND HAMILTONIAN CYCLE
, 2018 By Smith’s theorem, if a cubic graph has a Hamiltonian cycle, then it has a second Hamiltonian cycle. Thomason [‘Hamilton cycles and uniquely edge-colourable graphs’, Ann. Discrete Math.3 (1978), 259–268] gave a simple algorithm to find the second cycle.
LIANG ZHONG
core +1 more source
Hamiltonian cycles in subdivided doubles
Ars Mathematica ContemporaneaThe subdivided double construction on 4-regular graphs was used by Potočnik and Wilson to explore semi-symmetric (edge-transitive but not vertex-transitive) graphs, and can be used to construct every semi-symmetric 4-regular graph that contains a pair of twin vertices.
openaire +2 more sources