Results 51 to 60 of about 1,865,243 (219)
IEEE Access, 2021 In order to solve the NP-hard problem of mobile sink path planning in wireless sensor networks (WSN) where the communication range is modeled as a circular area and overlaps with each other, this paper proposes a sink node path planning method guided by ...
Zhijie Huang +4 more
doaj +1 more source
Forbidden subgraphs that imply Hamiltonian-connectedness [PDF]
, 1999 It is proven that if $G$ is a $3$-connected claw-free graph which is also $Z_3$-free (where $Z_3$ is a triangle with a path of length $3$ attached), $P_6$-free (where $P_6$ is a path with $6$ vertices) or $H_1$-free (where $H_1$ consists of two disjoint ...
Broersma, H.J. +4 more
core +2 more sources
Three infinite families of Hamilton-connected convex polytopes and their detour index
AIMS MathematicsA path in a graph encompassing its whole vertex set is called Hamiltonian. Such a path with sharing the same initial and terminal vertices is called a Hamiltonian cycle. A graph comprising a Hamiltonian path (resp.
Sakander Hayat +3 more
doaj +1 more source
The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves
Theory and Applications of Graphs, 2021 The color number c(G) of a cubic graph G is the minimum cardinality of a color class of a proper 4-edge-coloring of G. It is well-known that every cubic graph G satisfies c(G) = 0 if G has a Hamiltonian cycle, and c(G) ≤ 2 if G has a Hamiltonian path. In
Analen Malnegro +2 more
doaj +1 more source
Chromatic Roots and Hamiltonian Paths
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Hamiltonian Paths in Some Classes of Grid Graphs
Journal of Applied Mathematics, 2012 The Hamiltonian path problem for general grid graphs is known to be NP-complete. In this paper, we give necessary and sufficient conditions for the existence of Hamiltonian paths in L-alphabet, C-alphabet, F-alphabet, and E-alphabet grid graphs.
Fatemeh Keshavarz-Kohjerdi +1 more
doaj +1 more source
On hamiltonian chain saturated uniform hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graphs and ...
Aneta Dudek, Andrzej Zak
doaj +1 more source
Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph
Моделирование и анализ информационных систем, 2021 We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson polytopes is an
Alexander V. Korostil +1 more
doaj +1 more source
, 2008 The imaginary-time path integral representation of the canonical partition function of a quantum system and non-equilibrium work fluctuation relations are combined to yield methods for computing free energy differences in quantum systems using non ...
B. J. Berne +11 more
core +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.
openaire +3 more sources