Results 31 to 40 of about 154,862 (311)
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
On the Coherent State Path Integral for Linear Systems [PDF]
, 2005 We present a computation of the coherent state path integral for a generic linear system using ``functional methods'' (as opposed to discrete time approaches).
A. Albeverio +9 more
core +4 more sources
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
Problems on Shortest k-Node Cycles and Paths
Кібернетика та комп'ютерні технології, 2021 The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph.
Petro Stetsyuk +2 more
doaj +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
An evaluation of the number of Hamiltonian paths [PDF]
Journal de Physique Lettres, 1985 The number of Hamiltonian walks on a regular lattice of N points, with coordination number q is of the form ωNH for N → ∞. We obtain an estimate ωH ∼ q/e in surprising agreement with available data in two dimensions.
Orland, Henri +2 more
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
Irreducible Hamiltonian BRST approach to topologically coupled abelian forms [PDF]
, 1999 An irreducible Hamiltonian BRST approach to topologically coupled p- and (p+1)-forms is developed. The irreducible setting is enforced by means of constructing an irreducible Hamiltonian first-class model that is equivalent from the BRST point of view to
Green M B +6 more
core +2 more sources
Length minimizing Hamiltonian paths for symplectically aspherical manifolds [PDF]
, 2002 In this paper we consider the length minimizing properties of Hamiltonian paths generated by quasi-autonomous Hamiltonians on symplectically aspherical manifolds. Motivated by the work of L. Polterovich and M.
Kerman, Ely, Lalonde, Francois
core +3 more sources
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