Results 301 to 310 of about 3,095,070 (339)

Detecting Hamiltonian cycles

Applied Mathematics and Computation, 1992
We present some conditions equivalent to the existence of a Hamiltonian cycle in a graph on n vertices. Among other things, we show that for each n, there is an explicitly determined nxn diagonal matrix D such that if A is the adjacency matrix of such a graph, then the existence of a Hamiltonian cycle is completely determined by the eigenvalues of AD ...
openaire   +2 more sources

Hamiltonian Cycles and Markov Chains

Mathematics of Operations Research, 1994
In this paper we derive new characterizations of the Hamiltonian cycles of a directed graph, and a new LP-relaxation of the Traveling Salesman Problem. Our results are obtained via an embedding of these combinatorial optimization problems in suitably perturbed controlled Markov chains.
Filar, JA, Krass, D
openaire   +3 more sources

Distributing vertices on Hamiltonian cycles

Journal of Graph Theory, 2011
AbstractLet G be a graph of order n and 3≤t≤n/4 be an integer. Recently, Kaneko and Yoshimoto [J Combin Theory Ser B 81(1) (2001), 100–109] provided a sharp δ(G) condition such that for any set X of t vertices, G contains a hamiltonian cycle H so that the distance along H between any two vertices of X is at least n/2t.
Faudree, Ralph J., Gould, Ronald, Jacobson, Michael S., Magnant, Colton   +3 more
openaire   +3 more sources

Sufficient and Necessary Conditions for an Edge in the Optimal Hamiltonian Cycle Based on Frequency Quadrilaterals

Journal of Optimization Theory and Applications, 2019
Yong Wang
semanticscholar   +1 more source

THE COMPLEXITY OF THOMASON’S ALGORITHM FOR FINDING A SECOND HAMILTONIAN CYCLE

Bulletin of the Australian Mathematical Society, 2018
Liang Zhong
semanticscholar   +1 more source

State preparation and evolution in quantum computing: A perspective from Hamiltonian moments

International Journal of Quantum Chemistry, 2022
Trevor Keen, Bo Peng
exaly  

On the Exact Complexity of Hamiltonian Cycle and q-Colouring in Disk Graphs

International/Italian Conference on Algorithms and Complexity, 2017
Sándor Kisfaludi-Bak, Tom C. van der Zanden   +1 more
semanticscholar   +1 more source

Hamiltonian Cycles in Graphs

Annals of the New York Academy of Sciences, 1989
Feng Tian, Zhenhong Liu, Yongjin Zhu
openaire   +2 more sources

Hamiltonian Cycle and Path Embeddings in 3-Ary n-Cubes Based on K1,2-Structure Faults

2016 IEEE Trustcom/BigDataSE/ISPA, 2016
Yali Lv, Cheng-Kuan Lin, Jianxi Fan
semanticscholar   +1 more source

Hamiltonian-Driven Adaptive Dynamic Programming With Approximation Errors

IEEE Transactions on Cybernetics, 2022
Chengzhong Xu, Donald C Wunsch, Hamidreza Modares   +2 more
exaly