Results 1 to 10 of about 1,206,642 (268)
An Image Encryption Algorithm Based on Random Hamiltonian Path [PDF]
Entropy, 2020 In graph theory, Hamiltonian path refers to the path that visits each vertex exactly once. In this paper, we designed a method to generate random Hamiltonian path within digital images, which is equivalent to permutation in image encryption.
Wei Zhang +4 more
doaj +5 more sources
New Sufficient Conditions for Hamiltonian Paths [PDF]
The Scientific World Journal, 2014 A Hamiltonian path in a graph is a path involving all the vertices of the graph. In this paper, we revisit the famous Hamiltonian path problem and present new sufficient conditions for the existence of a Hamiltonian path in a graph.
M. Sohel Rahman +2 more
doaj +6 more sources
The Property of Hamiltonian Connectedness in Toeplitz Graphs
Complexity, 2020 A spanning path in a graph G is called a Hamiltonian path. To determine which graphs possess such paths is an NP-complete problem. A graph G is called Hamiltonian-connected if any two vertices of G are connected by a Hamiltonian path.
Ayesha Shabbir +2 more
doaj +2 more sources
Parallel Backtracking Algorithm for Hamiltonian Path Search
Communications, 2009 The speed of calculations is a common problem to tackle in many areas of scientific research and real life. This paper presents an implementation of a parallel backtracking algorithm.
Karol Grondzak, Penka Martincova
doaj +2 more sources
Journal of Combinatorial Theory, Series B, 1996 It is shown that if the minimum degree of a graph \(G\) on \(n\) vertices is at least \((2n-1)/3\) then \(G\) contains a subgraph that can be obtained from a hamiltonian path by adding all edges joining vertices of distance two on the path.
Genghua Fan, Henry A. Kierstead
openaire +2 more sources
Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable [PDF]
Discussiones Mathematicae Graph Theory, 2020 A graph G is k-Hamiltonian if for all X ⊂ V (G) with |X| ≤ k, the subgraph induced by V (G) \ X is Hamiltonian. A graph G is k-path-coverable if V (G) can be covered by k or fewer vertex disjoint paths.
Liu Weijun +3 more
doaj +2 more sources
Hamiltonian path analysis of viral genomes [PDF]
Nature Communications, 2018 Reidun Twarock +2 more
doaj +2 more sources
The Hamiltonian alternating path problem [PDF]
, 2012 In this paper, we consider the Hamiltonian alternating path problem for graphs, multigraphs, and digraphs. We describe an approach to solve the problem. This approach is based on constructing logical models for the problem. We use logical models for the Hamiltonian alternating path problem to solve the Hamiltonian path problem and the planning a ...
Gorbenko, Anna, Popov, Vladimir
openaire +3 more sources
Hamiltonian formalism for path-dependent Lagrangians [PDF]
Physical Review D, 1987 A presymplectic structure for path-dependent Lagrangian systems is set up such that, when applied to ordinary Lagrangians, it yields the familiar Legendre transformation. It is then applied to derive a Hamiltonian formalism and the conserved quantities for those predictive invariant systems whose solutions also satisfy a Fokker-type action principle.
Jaén, Xavier +3 more
openaire +5 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