Results 61 to 70 of about 1,825,425 (354)
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
A bridge over a Hamiltonian path [PDF]
The Mathematical Intelligencer, 2001 Abstract included in text.
McGuire, Gary, Ó Cairbre, Fiacre
openaire +3 more sources
Hamiltonian paths in Cayley graphs
Discrete Mathematics, 2009 AbstractThe classical question raised by Lovász asks whether every Cayley graph is Hamiltonian. We present a short survey of various results in that direction and make some additional observations. In particular, we prove that every finite group G has a generating set of size at most log2|G|, such that the corresponding Cayley graph contains a ...
Radoš Radoičić, Igor Pak
openaire +2 more sources
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
Hamilton-connectedness and Hamilton-laceability of planar geometric graphs with applications
AIMS Mathematics, 2021 In this paper, we have used two different proof techniques to show the Hamilton-connectedness of graphs. By using the vertex connectivity and Hamiltoniancity of graphs, we construct an infinite family of Hamilton-connected convex polytope line graphs ...
Suliman Khan +4 more
doaj +1 more source
Noncrossing Hamiltonian Paths in Geometric Graphs [PDF]
Discrete Applied Mathematics, 2004 AbstractA geometric graph is a graph embedded in the plane in such a way that vertices correspond to points in general position and edges correspond to segments connecting the appropriate points. A noncrossing Hamiltonian path in a geometric graph is a Hamiltonian path which does not contain any intersecting pair of edges.
Jakub erný +3 more
openaire +2 more sources
Hamiltonian Properties of DCell Networks
, 2015 DCell has been proposed for data centers as a server centric interconnection network structure. DCell can support millions of servers with high network capacity by only using commodity switches.
Erickson, Alejandro +3 more
core +1 more source
Advanced Engineering Materials, EarlyView.The utilization of direct energy deposition (DED)‐arc additive manufacturing processes in industrial applications is increasing, and these processes have the potential for multi‐material applications. This work provides a overview of the state of research in DED‐arc made functional graded structures, to establish a link to potential industrial ...
Kai Treutler, Volker Wesling
wiley +1 more source
Path Integral for non-relativistic Generalized Uncertainty Principle corrected Hamiltonian
, 2012 Generalized Uncertainty Principle (GUP) has brought the idea of existence of minimum measurable length in Quantum physics. Depending on this GUP, non-relativistic Hamiltonian at the Planck scale is modified.
das, Sudipta, Pramanik, Souvik
core +1 more source
The Hamiltonian problem and t-path traceable graphs [PDF]
Involve, a Journal of Mathematics, 2017 12 pages, 4 ...
Bari, Kashif, O’Sullivan, Michael
openaire +5 more sources