Results 31 to 40 of about 1,865,243 (219)
Noncrossing Hamiltonian Paths in Geometric Graphs [PDF]
Discrete Applied Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Černý, Jakub +3 more
openaire +2 more sources
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
Path Integral Monte Carlo Approach to the U(1) Lattice Gauge Theory in (2+1) Dimensions [PDF]
, 2002 Path Integral Monte Carlo simulations have been performed for U(1) lattice gauge theory in (2+1) dimensions on anisotropic lattices. We extractthe static quark potential, the string tension and the low-lying "glueball" spectrum.The Euclidean string ...
A. Dabringhaus +56 more
core +2 more sources
Solving the Hamiltonian path problem with a light-based computer [PDF]
Natural Computing, 2007 In this paper we propose a special computational device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representation and the light is traversing it by following the routes given by the ...
Mihai Oltean
semanticscholar +1 more source
Hamiltonian Formalism for Space-time Non-commutative Theories [PDF]
, 2000 Space-time non-commutative theories are non-local in time. We develop the Hamiltonian formalism for non-local field theories in d space-time dimensions by considering auxiliary d+1 dimensional field theories which are local with respect to the evolution ...
A. D. Fokker +22 more
core +4 more sources
Proper Hamiltonian Paths in Edge-Coloured Multigraphs [PDF]
Graphs and Combinatorics, 2011 Given a $c$-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an edge-coloured multigraph to guarantee the existence of a proper Hamiltonian path, involving various parameters as the ...
Águeda, Raquel +5 more
openaire +6 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
Canonical Transformations and Path Integral Measures
, 1994 This paper is a generalization of previous work on the use of classical canonical transformations to evaluate Hamiltonian path integrals for quantum mechanical systems.
A. Niemi +19 more
core +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
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