Results 11 to 20 of about 1,860,621 (344)
New Sufficient Conditions for Hamiltonian Paths [PDF]
The Scientific World Journal, 2014 A Hamiltonian path in a graph is a path involving all the vertices of the graph. In this paper, we revisit the famous Hamiltonian path problem and present new sufficient conditions for the existence of a Hamiltonian path in a graph.
M. Sohel Rahman +2 more
doaj +4 more sources
Covariant Hamiltonian field theory. Path integral quantization [PDF]
International Journal of Theoretical Physics, 2004 The Hamiltonian counterpart of classical Lagrangian field theory is covariant Hamiltonian field theory where momenta correspond to derivatives of fields with respect to all world coordinates.
Bashkirov, D., Sardanashvily, G.
core +5 more sources
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
DISTRIBUTED HAMILTONIAN PATH SEARCH ALGORITHM
Perner’s Contacts, 2010 Many practical problems of transportation can be transformed to the problem of finding Hamiltonian path or circle. It was proven, that this problem is NP-complete and thus can be very time-consuming for practical problem size. In this paper we present a
Karol Grondžák
doaj +1 more source
Quantum Zeno approach for molecular energies with maximum commuting initial Hamiltonians
Physical Review Research, 2021 We propose to use a quantum adiabatic and simulated-annealing framework to compute the ground state of small molecules. The initial Hamiltonian of our algorithms is taken to be the maximum commuting Hamiltonian that consists of a maximal set of commuting
Hongye Yu, Tzu-Chieh Wei
doaj +1 more source
Hamiltonian orthogeodesic alternating paths
Journal of Discrete Algorithms, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emilio Di Giacomo +4 more
openalex +6 more sources
Hamiltonian Cycle Problem in Strong k-Quasi-Transitive Digraphs With Large Diameter
Discussiones Mathematicae Graph Theory, 2021 Let k be an integer with k ≥ 2. A digraph is k-quasi-transitive, if for any path x0x1... xk of length k, x0 and xk are adjacent. Let D be a strong k-quasi-transitive digraph with even k ≥ 4 and diameter at least k +2.
Wang Ruixia
doaj +1 more source
Properties of SuperHyperGraph and Neutrosophic SuperHyperGraph [PDF]
Neutrosophic Sets and Systems, 2022 New setting is introduced to study dominating, resolving, coloring, Eulerian(Hamiltonian) neutrosophic path, n-Eulerian(Hamiltonian) neutrosophic path, zero forcing number, zero forcing neutrosophicnumber, independent number, independent neutrosophic ...
Henry Garrett
doaj +1 more source
Proper Hamiltonian Paths in Edge-Coloured Multigraphs [PDF]
Graphs and Combinatorics, 2014 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 ...
Raquel Águeda +5 more
openalex +8 more sources
Discussiones Mathematicae Graph Theory, 2022 A graph is called Hamiltonian extendable if there exists a Hamiltonian path between any two nonadjacent vertices. In this paper, we give an explicit formula of the minimum number of edges for Hamiltonian extendable graphs and we also characterize the ...
Yang Xiaojing, Xiong Liming
doaj +1 more source