Results 31 to 40 of about 1,206,642 (268)
Hamiltonian paths in Cayley graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Igor Pak, Rados Radoicic
openaire +3 more sources
Hamiltonian colorings of graphs with long cycles [PDF]
, 2003 summary:By a hamiltonian coloring of a connected graph $G$ of order $n \ge 1$ we mean a mapping $c$ of $V(G)$ into the set of all positive integers such that $\vert c(x) - c(y)\vert \ge n - 1 - D_G(x, y)$ (where $D_G(x, y)$ denotes the length of a ...
Nebeský, Ladislav
core +1 more source
A Hofer-Type Norm of Hamiltonian Maps on Regular Poisson Manifold
Journal of Applied Mathematics, 2014 We define a Hofer-type norm for the Hamiltonian map on regular Poisson manifold and prove that it is nondegenerate. We show that the L1,∞-norm and the L∞-norm coincide for the Hamiltonian map on closed regular Poisson manifold and give some sufficient ...
Dawei Sun, Zhenxing Zhang
doaj +1 more source
Hamiltonian paths on Platonic graphs [PDF]
International Journal of Mathematics and Mathematical Sciences, 2004 We develop a combinatorial method to show that the dodecahedron graph has, up to rotation and reflection, a unique Hamiltonian cycle. Platonic graphs with this property are called topologically uniquely Hamiltonian. The same method is used to demonstrate topologically distinct Hamiltonian cycles on the icosahedron graph and to show that a regular graph
openaire +2 more sources
Hamiltonian path, routing, broadcasting algorithms for connected square network graphs
Engineering Science and Technology, an International Journal, 2023 Connected Square Network Graphs (CSNG) in the study of Selcuk (2022) and Selcuk and Tankul (2022) is reconsidered in this paper. Although (CSNG) is a 2-dimensional mesh structure, the most important feature of this graph is that it is a hypercube variant.
Burhan Selçuk +1 more
doaj +1 more source
Hamiltonian paths and hamiltonian connectivity in graphs
Discrete Mathematics, 1993 A degree and neighborhood type condition on independent triples of vertices of a graph \(G\) that implies \(G\) is hamiltonian-connected is given. In particular, the following is proved. If \(G\) is a 3-connected graph of order \(n\) such that \(d(u) + d(v) + d(w)-| N(u) \cap N(v) \cap N(w) | \geq n+1,\) then \(G\) is hamiltonian-connected.
openaire +3 more sources
Hamiltonian path based shadow removal [PDF]
Procedings of the British Machine Vision Conference 2005, 2005 For some computer vision tasks, the presence of shadows in images can cause problems. For example, object tracks can be lost as an object crosses over a shadow boundary. Recently, it has been shown that it is possible to remove shadows from images.
Fredembach, Clément, Finlayson, Graham
openaire +2 more sources
A note on K-path hamiltonian graphs
, 1969 A graph G on p vertices is k-path Hamiltonian if every path of length not exceeding k, 1≤k≤p−2, is contained in a Hamiltonian cycle of G.
Kronk, Hudson V.
core +1 more source
De-Signing Hamiltonians for Quantum Adiabatic Optimization [PDF]
Quantum, 2020 Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization.
Elizabeth Crosson +3 more
doaj +1 more source
, 2012 Figure from Adleman 1994 (5). In the pictured directed graph, there is a unique Hamiltonian path from vertex 0 to vertex 6: 0123456.
Barbara Bryant (166998)
core +1 more source