Results 11 to 20 of about 154,862 (311)
Absolute Differences Along Hamiltonian Paths
The Electronic Journal of Combinatorics, 2015 We prove that if the vertices of a complete graph are labeled with the elements of an arithmetic progression, then for any given vertex there is a Hamiltonian path starting at this vertex such that the absolute values of the differences of consecutive vertices along the path are pairwise distinct.
Francesco Monopoli
openalex +4 more sources
2-generated Cayley digraphs on nilpotent groups have hamiltonian paths [PDF]
, 2011 Suppose G is a nilpotent, finite group. We show that if {a,b} is any 2-element generating set of G, then the corresponding Cayley digraph Cay(G;a,b) has a hamiltonian path.
Dave Witte Morris
openalex +6 more sources
Finding Hamiltonian and Longest (s,t)-Paths of C-Shaped Supergrid Graphs in Linear Time
Algorithms, 2022 A graph is called Hamiltonian connected if it contains a Hamiltonian path between any two distinct vertices. In the past, we proved the Hamiltonian path and cycle problems for general supergrid graphs to be NP-complete.
Fatemeh Keshavarz-Kohjerdi, Ruo-Wei Hung
doaj +1 more source
, 2008 Given an embedded planar acyclic digraph G, we define the problem of "acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM)" to be the problem of determining an hamiltonian path completion set of edges such that, when these edges
Tamara Mchedlidze, Antonios Symvonis
openalex +4 more sources
Quantum Zeno approach for molecular energies with maximum commuting initial Hamiltonians
Physical Review Research, 2021 We propose to use a quantum adiabatic and simulated-annealing framework to compute the ground state of small molecules. The initial Hamiltonian of our algorithms is taken to be the maximum commuting Hamiltonian that consists of a maximal set of commuting
Hongye Yu, Tzu-Chieh Wei
doaj +1 more source
Hamiltonian paths and cycles in hypertournaments [PDF]
Journal of Graph Theory, 1997 Given two integers n and k, n ≥ k > 1, a k-hypertournament T on n vertices is a pair (V, A), where V is a set of vertices, |V| = n and A is a set of k-tuples of vertices, called arcs, so that for any k-subset S of V, A$ contains exactly one of the k! k-tuples whose entries belong to S. A 2-hypertournament is merely an (ordinary) tournament. A path is a
Gutin, Gregory, Yeo, A.
openaire +10 more sources
Hamiltonian Cycle Problem in Strong k-Quasi-Transitive Digraphs With Large Diameter
Discussiones Mathematicae Graph Theory, 2021 Let k be an integer with k ≥ 2. A digraph is k-quasi-transitive, if for any path x0x1... xk of length k, x0 and xk are adjacent. Let D be a strong k-quasi-transitive digraph with even k ≥ 4 and diameter at least k +2.
Wang Ruixia
doaj +1 more source
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph [PDF]
Neutrosophic Sets and Systems, 2022 New setting is introduced to study dominating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) neutrosophic path, zero forcing number, zero forcing neutrosophicnumber, independent number, independent neutrosophic ...
Henry Garrett
doaj +1 more source
Existence of Dλ-cycles and Dλ-paths [PDF]
, 1983 A cycle of C of a graph G is called a Dλ-cycle if every component of G − V(C) has order less than λ. A Dλ-path is defined analogously. In particular, a D1-cycle is a hamiltonian cycle and a D1-path is a hamiltonian path.
Veldman, H.J.
core +8 more sources
Quantum-Walk-Inspired Dynamic Adiabatic Local Search
Entropy, 2023 We investigate the irreconcilability issue that arises when translating the search algorithm from the Continuous Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework.
Chen-Fu Chiang, Paul M. Alsing
doaj +1 more source