Results 41 to 50 of about 1,825,425 (354)
Discussiones Mathematicae Graph Theory, 2015 For integers k and n with 2 ≤ k ≤ n − 1, a graph G of order n is k-path pancyclic if every path P of order k in G lies on a cycle of every length from k + 1 to n. Thus a 2-path pancyclic graph is edge-pancyclic.
Bi Zhenming, Zhang Ping
doaj +1 more source
Grafos hamiltonianos en el diseño de viajes
Modelling in Science Education and Learning, 2013 The existence and, if applicable, the location of paths with given properties is a topic in graph theory. One of these problems is to find routes through all points, only once, starting and ending at the same node.
Cristina Jordán Lluch +1 more
doaj +1 more source
Coherent State Path Integrals in the Weyl Representation [PDF]
, 2006 We construct a representation of the coherent state path integral using the Weyl symbol of the Hamiltonian operator. This representation is very different from the usual path integral forms suggested by Klauder and Skagerstan in \cite{Klau85}, which ...
Baranger M +8 more
core +2 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
Renormalized Path Integral in Quantum Mechanics [PDF]
, 1996 We obtain direct, finite, descriptions of a renormalized quantum mechanical system with no reference to ultraviolet cutoffs and running coupling constants, in both the Hamiltonian and path integral pictures.
Henderson, R. J., Rajeev, S. G.
core +3 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 description of combined Hamiltonian and non-Hamiltonian dynamics in quantum dissipative systems [PDF]
, 2016 We present a numerical path-integral iteration scheme for the low-dimensional reduced density matrix of a time-dependent quantum dissipative system. Our approach simultaneously accounts for the combined action of a microscopically modeled pure-dephasing ...
A. Barth, A. Vagov, V. M. Axt
semanticscholar +1 more source
Absolute Differences Along Hamiltonian Paths
The Electronic Journal of Combinatorics, 2015 We prove that if the vertices of a complete graph are labeled with the elements of an arithmetic progression, then for any given vertex there is a Hamiltonian path starting at this vertex such that the absolute values of the differences of consecutive vertices along the path are pairwise distinct.
Francesco Monopoli
openalex +4 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
On Cayley digraphs that do not have hamiltonian paths [PDF]
, 2013 We construct an infinite family of connected, 2-generated Cayley digraphs Cay(G;a,b) that do not have hamiltonian paths, such that the orders of the generators a and b are arbitrarily large.
Morris, Dave Witte
core +4 more sources