Results 11 to 20 of about 3,678 (251)
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
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
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
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
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
Linear Hamiltonian behaviors and bilinear differential forms [PDF]
, 2004 We study linear Hamiltonian systems using bilinear and quadratic differential forms. Such a representation-free approach allows us to use the same concepts and techniques to deal with systems isolated from their environment and with systems subject to ...
Rapisarda, P. +7 more
core +1 more source
On the saturation number of Hamiltonian path
上海师范大学学报. 自然科学版, 2022 Let $F$ be a graph and graph $G$ is said to be $F$-saturated if $G$ is $F$-free.However, for any edge $e\in E(\overline{G})$, $G+e$ contains $F$.Let sat($n,F$)= min{|$E(G)$|:|$V(G)$|=$n$ and $G$ is $F$-saturated}. We will show that there exists sat($n,P_{
DING Tianping, JIN Yalei, ZHANG Qian
doaj +1 more source
Hamiltonian orthogeodesic alternating paths
Journal of Discrete Algorithms, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Emilio Di Giacomo +4 more
openaire +5 more sources
Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable
Discussiones Mathematicae Graph Theory, 2020 A graph G is k-Hamiltonian if for all X ⊂ V (G) with |X| ≤ k, the subgraph induced by V (G) \ X is Hamiltonian. A graph G is k-path-coverable if V (G) can be covered by k or fewer vertex disjoint paths.
Liu Weijun +3 more
doaj +1 more source
Reliability of systems with randomly varying parameters by the path integration method [PDF]
, 2011 The paper considers a first passage time reliability problem for systems subjected to multiplicative and additive white noises. For numerical calculations of the reliability function and the first passage time the path integration method is properly ...
Yurchenko, Daniil +5 more
core +1 more source