Results 31 to 40 of about 52,480 (200)
On a computer-aided approach to the computation of Abelian integrals [PDF]
, 2011 An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems.
A. Neumaier +27 more
core +2 more sources
Hamiltonian cycles and travelling salesfolk
International Journal of Science and Research (IJSR), 2023 A method is given in this paper that makes it easier to solve both the Hamiltonian cycle problem and the travelling salesman problem in any number of space dimensions and in both their directed and undirected varieties.
openaire +1 more source
Limit Cycle Bifurcations from Centers of Symmetric Hamiltonian Systems Perturbing by Cubic Polynomials [PDF]
, 2012 In this paper, we consider some cubic near-Hamiltonian systems obtained from perturbing the symmetric cubic Hamiltonian system with two symmetric singular points by cubic polynomials.
Gao, Bin +2 more
core +1 more source
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank [PDF]
, 2017 For even $k$, the matchings connectivity matrix $\mathbf{M}_k$ encodes which pairs of perfect matchings on $k$ vertices form a single cycle. Cygan et al.
Curticapean, Radu +2 more
core +3 more sources
Hamiltonian cycles in k‐partite graphs [PDF]
Journal of Graph Theory, 2019 AbstractChen et al determined the minimum degree threshold for which a balanced ‐partite graph has a Hamiltonian cycle. We give an asymptotically tight minimum degree condition for Hamiltonian cycles in arbitrary ‐partite graphs in that all parts have at most vertices (a necessary condition).
Louis DeBiasio +3 more
openaire +3 more sources
On Extremal Hypergraphs for Hamiltonian Cycles [PDF]
Electronic Notes in Discrete Mathematics, 2011 We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Tur n- and Dirac-type results. While the Tur n-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph depending only on the extremal number of a certain path, the Dirac-type result yields a sufficient condition relying solely ...
Glebov, Roman, Person, Yury, Weps, Wilma
openaire +3 more sources
Hamiltonian paths on Platonic graphs
International Journal of Mathematics and Mathematical Sciences, 2004 We develop a combinatorial method to show that the dodecahedron graph has, up to rotation and reflection, a unique Hamiltonian cycle. Platonic graphs with this property are called topologically uniquely Hamiltonian. The same method is used to demonstrate
Brian Hopkins
doaj +1 more source
The One-Fault Directed Dimension-Balanced Hamiltonian Problem in Directed Toroidal Mesh Graphs
Applied SciencesHamiltonian cycle problems play a central role in graph theory and have wide-ranging applications in network-on-chip architectures, interconnection networks, and large-scale parallel systems.
Yancy Yu-Chen Chang, Justie Su-Tzu Juan
doaj +1 more source
A Theorem on Even Pancyclic Bipartite Digraphs
Mathematical Problems of Computer Science, 2021 We prove a Meyniel-type condition and a Bang-Jensen, Gutin and Li-type condition for a strongly connected balanced bipartite digraph to be even pancyclic. Let D be a balanced bipartite digraph of order 2a ≥ 6.
Samvel Kh. Darbinyan
doaj +1 more source
The parity Hamiltonian cycle problem
Discrete Mathematics, 2018 Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visits every vertex an odd number of times, where we remark that the walk may use an edge more than once. First, we give a complete characterization of the graphs which have PHCs,
Nishiyama, Hiroshi +4 more
openaire +3 more sources