Results 11 to 20 of about 3,095,070 (339)
On $2$-pyramidal Hamiltonian cycle systems [PDF]
Bulletin of the Belgian Mathematical Society - Simon Stevin, 2014 A Hamiltonian cycle system of the complete graph minus a 1–factor K2v − I (briefly, an HCS(2v)) is 2-pyramidal if it admits an automorphism group of order 2v − 2 fixing two vertices.
R. A. Bailey +3 more
semanticscholar +7 more sources
Removable matchings and hamiltonian cycles
Discrete Mathematics, 2008 AbstractFor a graph G, let σ2(G) denote the minimum degree sum of two nonadjacent vertices (when G is complete, we let σ2(G)=∞). In this paper, we show the following two results: (i) Let G be a graph of order n≥4k+3 with σ2(G)≥n and let F be a matching of size k in G such that G−F is 2-connected.
Zhiquan Hu, Hao Li
openalex +3 more sources
High-dimensional Clustering onto Hamiltonian Cycle [PDF]
International Conference on Machine Learning, 2023 Clustering aims to group unlabelled samples based on their similarities. It has become a significant tool for the analysis of high-dimensional data.
Tianyi Huang +3 more
semanticscholar +1 more source
The Hardest Hamiltonian Cycle Problem Instances: The Plateau of Yes and the Cliff of No
SN Computer Science, 2022 We use two evolutionary algorithms to make hard instances of the Hamiltonian cycle problem. Hardness (or ‘fitness’), is defined as the number of recursions required by Vandegriend–Culberson, the best known exact backtracking algorithm for the problem ...
J. Sleegers, Daan van den Berg
semanticscholar +1 more source
Universally Hard Hamiltonian Cycle Problem Instances
International Joint Conference on Computational Intelligence, 2022 : In 2021, evolutionary algorithms found the hardest-known yes and no instances for the Hamiltonian cycle problem. These instances, which show regularity patterns, require a very high number of recursions for the best exact backtracking algorithm ...
J. Sleegers, S. Thomson, D. V. D. Berg
semanticscholar +1 more source
A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology
Computers Materials & Continua, 2021 : Many routing protocols, such as distance vector and link-state protocols are used for finding the best paths in a network. To find the path between the source and destination nodes where every node is visited once with no repeats, Hamiltonian and ...
Adnan A. Hnaif +3 more
semanticscholar +1 more source
Discrete Mathematics, 2022 If the line graph of a graph $G$ decomposes into Hamiltonian cycles, what is $G$? We answer this question for decomposition into two cycles.
Vaidy Sivaraman, Thomas Zaslavsky
openaire +2 more sources
Counting Traversing Hamiltonian Cycles in Tiled Graphs
Mathematics, 2023 Recently, the problem of counting Hamiltonian cycles in 2-tiled graphs was resolved by Vegi Kalamar, Bokal, and Žerak. In this paper, we continue our research on generalized tiled graphs.
Alen Vegi Kalamar
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
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