Results 31 to 40 of about 1,825,425 (354)
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
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
The Property of Hamiltonian Connectedness in Toeplitz Graphs
Complexity, 2020 A spanning path in a graph G is called a Hamiltonian path. To determine which graphs possess such paths is an NP-complete problem. A graph G is called Hamiltonian-connected if any two vertices of G are connected by a Hamiltonian path.
Ayesha Shabbir +2 more
doaj +1 more source
RUTE TERPENDEK UNTUK PENGANGKUTAN SAMPAH DENGAN PENDEKATAN LINTASAN HAMILTON
E-Jurnal Matematika, 2021 This research is related to the route of picking up the waste which done by janitors in housing complex of Aur Duri Indah Rt.14 Jambi considering the condition of that housing which have some crossroads, such that janitors take the same road twice which ...
SYAMSYIDA ROZI, CUT MULTAHADAH
doaj +1 more source
Quantum-Walk-Inspired Dynamic Adiabatic Local Search
Entropy, 2023 We investigate the irreconcilability issue that arises when translating the search algorithm from the Continuous Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework.
Chen-Fu Chiang, Paul M. Alsing
doaj +1 more source
Journal of Combinatorial Theory, Series B, 1996 It is shown that if the minimum degree of a graph \(G\) on \(n\) vertices is at least \((2n-1)/3\) then \(G\) contains a subgraph that can be obtained from a hamiltonian path by adding all edges joining vertices of distance two on the path.
Genghua Fan, Hal A. Kierstead
openaire +2 more sources
Graph of Fuzzy Topographic Topological Mapping in relation to k-Fibonacci Sequence
Journal of Mathematics, 2021 A generated n-sequence of fuzzy topographic topological mapping, FTTMn, is a combination of n number of FTTM’s graphs. An assembly graph is a graph whereby its vertices have valency of one or four. A Hamiltonian path is a path that visits every vertex of
Noorsufia Abd Shukor +4 more
doaj +1 more source
Path-integral isomorphic Hamiltonian for including nuclear quantum effects in non-adiabatic dynamics. [PDF]
Journal of Chemical Physics, 2017 We describe a path-integral approach for including nuclear quantum effects in non-adiabatic chemical dynamics simulations. For a general physical system with multiple electronic energy levels, a corresponding isomorphic Hamiltonian is introduced such ...
Xuecheng Tao +2 more
semanticscholar +1 more source
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
New Sufficient Conditions for Hamiltonian Paths
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 +1 more source