Results 51 to 60 of about 2,059,443 (151)
Hamiltonian paths on Platonic graphs
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
Brian Hopkins
doaj +1 more source
Energy Conditions for Hamiltonian and Traceable Graphs
Universal Journal of Mathematics and Applications, 2019 A graph is called Hamiltonian (resp. traceable) if the graph has a Hamiltonian cycle (resp. path), a cycle (resp. path) containing all the vertices of the graph. The energy of a graph is defined as the sum of the absolute values of the eigenvalues of the
Rao Li
doaj +1 more source
Gaussian Neighborhood-prime Labeling of Graphs Containing Hamiltonian Cycle [PDF]
, 2019 In this paper, we examine Gaussian neighborhood-prime labeling of generalized Peterson graph and graphs which contain Hamiltonian ...
S T Trivedi, N P Shrimali
core +1 more source
On Uniquely Hamiltonian Claw-Free and Triangle-Free Graphs
Discussiones Mathematicae Graph Theory, 2015 A graph is uniquely Hamiltonian if it contains exactly one Hamiltonian cycle. In this note, we prove that claw-free graphs with minimum degree at least 3 are not uniquely Hamiltonian.
Seamone Ben
doaj +1 more source
A closed -knight’s tour on some cylinder chessboards
AKCE International Journal of Graphs and Combinatorics, 2020 A -knight’s move on the cylinder chessboard is the move of the knight 2 squares vertically or 2 squares horizontally and then 3 squares perpendicular to it.
Sirirat Singhun +2 more
doaj +1 more source
On pedigree polytopes and Hamiltonian cycles
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
A more efficient way of finding Hamiltonian cycle
, 2015 Algorithm for finding Hamiltonian cycle.
Paweł Kaftan (568545)
core +1 more source
Hamiltonian Dynamics in the Theory of Abstraction [PDF]
, 2012 This paper deals with fluid flow dynamics which may be Hamiltonian in nature and yet chaotic.Here we deal with sympletic invariance, canonical transformations and stability of such Hamiltonian flows. As a collection of points move along, it carries along
Ganguly, Subhajit +1 more
core +1 more source
Weakly Dimension-Balanced Hamiltonian Cycle on Three-Dimensional Toroidal Mesh Graph
Engineering ProceedingsThe dimension-balanced cycle (DBC) problem is new in graph theory, with applications such as 3D stereogram reconstruction. In a graph whose edges are partitioned into k dimensions, a cycle is dimension-balanced if edge counts across dimensions differ by ...
Chia-Pei Chu, Justie Su-Tzu Juan
doaj +1 more source
The One-Fault Directed Dimension-Balanced Hamiltonian Problem in Directed Toroidal Mesh Graphs
Applied SciencesHamiltonian cycle problems play a central role in graph theory and have wide-ranging applications in network-on-chip architectures, interconnection networks, and large-scale parallel systems.
Yancy Yu-Chen Chang, Justie Su-Tzu Juan
doaj +1 more source