Results 31 to 40 of about 1,982,910 (295)
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 +2 more
openaire +3 more sources
Hamiltonian Dynamics in the Theory of Abstraction [PDF]
, 2012 This paper deals with fluid flow dynamics which may be Hamiltonian in nature and yet chaotic.Here we deal with sympletic invariance, canonical transformations and stability of such Hamiltonian flows. As a collection of points move along, it carries along
Ganguly, Subhajit +1 more
core +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,
Hiroshi Nishiyama +4 more
openaire +3 more sources
Construction of discrete-time model for port-controlled Hamiltonian systems with applications [PDF]
, 2006 The issues of constructing a discrete-time model for Hamiltonian systems are in general different from those for dissipative systems. We propose an algorithm for constructing an approximate discrete-time model, which guarantees Hamiltonian conservation ...
Astolfi, A., +4 more
core +1 more source
Alternating Hamiltonian cycles in $2$-edge-colored multigraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an $\mathcal{NP ...
Alejandro Contreras-Balbuena +2 more
doaj +1 more source
The Parity of Directed Hamiltonian Cycles [PDF]
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 2013 We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n) expected time algorithm. Our algorithms are based on a new combinatorial formula for the number of Hamiltonian cycles modulo a ...
Björklund, Andreas, Husfeldt, Thore
openaire +3 more sources
Equivariant singularity theory with distinguished parameters: Two case studies of resonant Hamiltonian systems [PDF]
, 1998 We consider Hamiltonian systems near equilibrium that can be (formally) reduced to one degree of freedom. Spatio-temporal symmetries play a key role. The planar reduction is studied by equivariant singularity theory with distinguished parameters.
Vegter, G +15 more
core +1 more source
Hamiltonian Chains in Hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Hamiltionian chain is a generalisation of hamiltonian cycles for hypergraphs. Among the several possible ways of generalisations this is probably the most strong one, it requires the strongest structure.
Gyula Y. Katona
doaj +1 more source
Problems on Shortest k-Node Cycles and Paths
Кібернетика та комп'ютерні технології, 2021 The paper is devoted to the construction of mathematical models for problems on the shortest cycles and paths, that pass through a given number of nodes of a directed graph.
Petro Stetsyuk +2 more
doaj +1 more source
Hamiltonian cycles in torical lattices [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We establish sufficient conditions for a toric lattice $T_{m,n}$ to be Hamiltonian. Also, we give some asymptotics for the number of Hamiltonian cycles in $T_{m,n}$.
Vladimir K. Leontiev
doaj +1 more source