Results 81 to 90 of about 1,865,243 (219)
The Hamiltonian index of a graph and its branch-bonds [PDF]
, 2001 Let $G$ be an undirected and loopless finite graph that is not a path. The minimum $m$ such that the iterated line graph $L^m(G)$ is hamiltonian is called the hamiltonian index of $G,$ denoted by $h(G).$ A reduction method to determine the hamiltonian ...
Broersma, Haitze J. +4 more
core +1 more source
Hamiltonian paths in Cayley graphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pak, Igor, Radoičić, Radoš
openaire +2 more sources
Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs
Discussiones Mathematicae Graph Theory, 2018 Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of D, then D is a semicomplete digraph. A digraph D is locally semicomplete if for every vertex x, the out-neighbours of x induce a semicomplete digraph and ...
Li Ruijuan, Han Tingting
doaj +1 more source
Hamiltonian path of \(M_ k-v\)
Revista Técnica de la Facultad de Ingeniería, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eduardo Montenegro +1 more
openaire +2 more sources
Tree graph representation of hamiltonian paths
Computers & Mathematics with Applications, 1994 A Hamiltonian path of faces of a polyhedron consists of a sequence of adjacent faces which contains each face exactly once. This paper compares by using tree diagrams the Hamiltonian itineraries versus all possible itineraries of adjacent faces of the five regular polyhedrons. The graphs for the tetrahedron, octahedron and icosahedron are binary trees.
openaire +2 more sources
Hamiltonian paths passing through matchings in hypercubes with faulty edges
AIMS MathematicsChen considered the existence of a Hamiltonian cycle containing a matching and avoiding some edges in an $ n $-cube $ Q_n $. In this paper, we considered the existence of a Hamiltonian path and obtained the following result.
Shenyang Zhao, Fan Wang
doaj +1 more source
Determination of the Shortest Hamiltonian Paths in an Arbitrary Graph of Distributed Databases
Российский технологический журнал, 2019 A method has been developed for finding the shortest Hamiltonian path in an arbitrary graph based on the rank approach, which provides high efficiency and a significant reduction in the error in solving the problem of organizing the process of managing ...
E. G. Andrianova +2 more
doaj +1 more source
A New Form of Path Integral for the Coherent States Representation and its Semiclassical Limit
, 2004 The overcompleteness of the coherent states basis leads to a multiplicity of representations of Feynman's path integral. These different representations, although equivalent quantum mechanically, lead to different semiclassical limits.
de Aguiar, M. A. M., Santos, Luis C. dos
core +1 more source
The path integral representation kernel of evolution operator in Merton-Garman model
Condensed Matter Physics, 2011 In the framework of path integral the evolution operator kernel for the Merton-Garman Hamiltonian is constructed. Based on this kernel option formula is obtained, which generalizes the well-known Black-Scholes result.
V.S. Yanishevsky, L.F. Blazhyevskyi
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