Results 21 to 30 of about 2,059,443 (151)

Limit cycles of planar piecewise linear Hamiltonian differential systems with two or three zones

Electronic Journal of Qualitative Theory of Differential Equations, 2022
In this paper, we study the existence of limit cycles in continuous and discontinuous planar piecewise linear Hamiltonian differential system with two or three zones separated by straight lines and such that the linear systems that define the piecewise ...
Claudio Pessoa, Ronisio Ribeiro
doaj   +1 more source

Hamiltonian Cycles in T-Graphs [PDF]

Discrete & Computational Geometry, 2000
The vertices and polygonal edges of the planar Archimedean tiling \(3^6\) of the plane is called the triangular tiling graph (TTG). A subgraph \(G\) of TTG is linearly convex if, for every line \(L\) which contains an edge of TTG, the set \(L \cap G\) is a (possibly degenerated or empty) line segment.
John R. Reay, Tudor Zamfirescu
openaire   +3 more sources

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, Esther Sanabria-Codesal   +1 more
doaj   +1 more source

A remark on Hamiltonian cycles

Journal of Combinatorial Theory, Series B, 1981
AbstractEvery 2-connected graph G with δ ⩾ (v + κ)3 is hamiltonian where v denotes the order, δ the minimum degree and κ the point connectivity of G.
Roland Häggkvist, G. G. Nicoghossian
openaire   +1 more source

Second Hamiltonian Cycles in Claw-Free Graphs

Theory and Applications of Graphs, 2015
Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four contains a second Hamiltonian cycle. We prove that most claw-free Hamiltonian graphs with minimum degree at least 3 have a second Hamiltonian cycle and ...
Hossein Esfandiari, Colton Magnant, Pouria Salehi Nowbandegani, Shirdareh Haghighi   +3 more
doaj   +1 more source

Matchings Extend to Hamiltonian Cycles in 5-Cube

Discussiones Mathematicae Graph Theory, 2018
Ruskey and Savage asked the following question: Does every matching in a hypercube Qn for n ≥ 2 extend to a Hamiltonian cycle of Qn? Fink confirmed that every perfect matching can be extended to a Hamiltonian cycle of Qn, thus solved Kreweras’ conjecture.
Wang Fan, Zhao Weisheng
doaj   +1 more source

Hyper-Hamiltonian circulants

Electronic Journal of Graph Theory and Applications, 2021
A Hamiltonian graph G = (V,E) is called hyper-Hamiltonian if G-v is Hamiltonian for any v ∈ V(G). G is called a circulant if its automorphism group contains a |V(G)|-cycle.
Zbigniew R. Bogdanowicz
doaj   +1 more source

The H-force sets of the graphs satisfying the condition of Ore’s theorem

Open Mathematics, 2020
Let G be a Hamiltonian graph. A nonempty vertex set X⊆V(G)X\subseteq V(G) is called a Hamiltonian cycle enforcing set (in short, an H-force set) of G if every X-cycle of G (i.e., a cycle of G containing all vertices of X) is a Hamiltonian cycle.
Zhang Xinhong, Li Ruijuan
doaj   +1 more source

Graphs with few hamiltonian cycles

Mathematics of Computation, 2019
We describe an algorithm for the exhaustive generation of non-isomorphic graphs with a given number k ≥
Goedgebeur, Jan, Meersman, Barbara, Zamfirescu, Carol T.   +2 more
openaire   +3 more sources

Generalized honeycomb torus is Hamiltonian

, 2004
Generalized honeycomb torus is a candidate for interconnection network architectures, which includes honeycomb torus, honeycomb rectangular torus, and honeycomb parallelogramic torus as special cases. Existence of Hamiltonian cycle is a basic requirement
Yang, X., Megson, G.M., Evans, D.J., Lai, H.   +3 more
core   +2 more sources