Results 71 to 80 of about 2,059,443 (151)
Controlled Lagrangian and Hamiltonian Systems [PDF]
, 2002 any control systems are mechanical systems. The unique feature of mechanical systems is the notion of energy, which gives much information on the stability of equilibria.
Chang, Dong Eui
core +1 more source
The NPO-Completeness of the Longest Hamiltonian Cycle Problem
, 2014 [[abstract]]In this paper, the longest Hamiltonian cycle problem and the longest Hamiltonian path problem are proved to be NPO-complete.[[fileno]]2030256010065[[department ...
Wu, Q. S.;Chao, K. M.;Lee, R. C. T.
core +1 more source
2-Connected Hamiltonian Claw-Free Graphs Involving Degree Sum of Adjacent Vertices
Discussiones Mathematicae Graph Theory, 2020 For a graph H, define σ¯2(H)=min{d(u)+d(v)|uv∈E(H)}{{\bar \sigma }_2} ( H ) = \min \left\{ {d ( u ) + d ( v )|uv \in E ( H )} \right\} . Let H be a 2-connected claw-free simple graph of order n with δ(H) ≥ 3. In [J. Graph Theory 86 (2017) 193–212], Chen
Tian Tao, Xiong Liming
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2020 Let S = (a1,. . . , am; b1, . . . , bn), where a1, . . . , am and b1, . . . , bn are two sequences of nonnegative integers. We say that S is a bigraphic pair if there exists a simple bipartite graph G with partite sets {x1, x2, . . . , xm} and {y1, y2, .
Yin Jian-Hua, Li Sha-Sha
doaj +1 more source
On Hamiltonian alternating cycles and paths
Computational Geometry, 2018 We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an intensively studied problem, not always with a solution, when the paths and cycles are also required to be plane. In this paper, we relax the constraint on the cycles and paths from being plane to being 1-plane, and deal with the same ...
Mercè Claverol +4 more
openaire +9 more sources
Hamiltonian Strongly Regular Graphs [PDF]
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core
Enhanced prim's algorithm for finding the hamiltonian cycle in a graph [PDF]
, 2013 The Travelling Salesman Problem (TSP) is known as one of the oldest combinatorial optimisation problem which solves the path problem in weighted graph.
Dinon, Nur Atiqah
core
Finding a Hamiltonian cycle using the Chebyshev polynomials [PDF]
summary:We present an algorithm of finding the Hamiltonian cycle in a general undirected graph by minimization of an appropriately chosen functional. This functional depends on the characteristic polynomial of the graph Laplacian matrix and attains its ...
Vlasák, Miloslav, Lamač, Jan
core +1 more source
On the Existence of a Second Hamilton Cycle in Hamiltonian Graphs With Symmetry [PDF]
, 2013 In 1975, Sheehan conjectured that every simple 4-regular hamiltonian graph has a second Hamilton cycle. If Sheehan's Conjecture holds, then the result can be extended to all simple d-regular hamiltonian graphs with d at least 3.
Wagner, Andrew
core +1 more source