Results 21 to 30 of about 154,862 (311)
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
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
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
Journal of Combinatorial Theory, Series B, 1996 AbstractA hamiltonian square-path (-cycle) is one obtained from a hamiltonian path (cycle) by joining every pair of vertices of distance two in the path (cycle). LetGbe a graph onnvertices with minimum degreeδ(G). Posá and Seymour conjectured that ifδ(G)⩾23n, thenGcontains a hamiltonian square-cycle.
Genghua Fan, Hal A. Kierstead
openaire +2 more sources
On Hamiltonicity of {claw, net}-free graphs [PDF]
, 2006 An st-path is a path with the end-vertices s and t. An s-path is a path with an end-vertex s. The results of this paper include necessary and sufficient conditions for a {claw, net}-free graph G with given two different vertices s, t and an edge e to ...
Kelmans, Alexander
core +3 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
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
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