Results 1 to 10 of about 2,479 (48)
CONTRACTIBLE HAMILTONIAN CYCLES IN POLYHEDRAL MAPS [PDF]
Discrete Mathematics, Algorithms and Applications, 2012 We present a necessary and sufficient condition for existence of a contractible Hamiltonian cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to find such cycles (if they exist). This is further generalized and shown to hold for more general maps.
Maity, Dipendu, Upadhyay, Ashish Kumar
openaire +3 more sources
A note on edge-disjoint contractible Hamiltonian cycles in polyhedral maps
Electronic Journal of Graph Theory and Applications, 2014 We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamiltonian Cycles in the edge graph of polyhedral maps.
Ashish K Upadhyay, Dipendu Maity
doaj +3 more sources
Geometric Mixing, Peristalsis, and the Geometric Phase of the Stomach. [PDF]
PLoS One, 2015 Mixing fluid in a container at low Reynolds number - in an inertialess environment - is not a trivial task. Reciprocating motions merely lead to cycles of mixing and unmixing, so continuous rotation, as used in many technological applications, would ...
Arrieta J +5 more
europepmc +9 more sources
A conjecture on the number of Hamiltonian cycles on thin grid cylinder graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Graph ...
Olga Bodroža-Pantić +2 more
doaj +1 more source
On dominating and spanning circuits in graphs [PDF]
, 1994 An eulerian subgraph of a graph is called a circuit. As shown by Harary and Nash-Williams, the existence of a Hamilton cycle in the line graph L(G) of a graph G is equivalent to the existence of a dominating circuit in G, i.e., a circuit such that every ...
Veldman, H.J.
core +13 more sources
Contractible Hamiltonian cycles in triangulated surfaces [PDF]
Elemente der Mathematik, 2014 A triangulation of a surface is called $q$-equivelar if each of its vertices is incident with exactly $q$ triangles. In 1972 Altshuler had shown that an equivelar triangulation of torus has a Hamiltonian Circuit. Here we present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in equivelar triangulation of a ...
openaire +3 more sources
Applicable Analysis and Discrete Mathematics, 2019 In a recent paper, we have studied the enumeration of Hamiltonian cycles (abbreviated HCs) on the grid cylinder graph Pm+1 x Cn, where m grows while n is fixed. In this sequel, we study a much harder problem of enumerating HCs on the same graph only this time letting n grow while m is fixed.
Olga Bodroza-Pantic +4 more
openaire +4 more sources
Contractible edges in longest cycles in non-Hamiltonian graphs
Discrete Mathematics, 1994 This paper addresses the question of how contractible edges are distributed in longest cycles in 3-connected graphs. It establishes the fact that in non-Hamiltonian 3-connected graphs, each longest cycle includes at least 6 contractible edges. An edge in a 3-connected graph is called contractible if the graph obtained from the contraction of the edge ...
Ellingham, M. N. +2 more
openaire +1 more source
A Limit Conjecture on the Number of Hamiltonian Cycles on Thin Triangular Grid Cylinder Graphs
Discussiones Mathematicae Graph Theory, 2018 We continue our research in the enumeration of Hamiltonian cycles (HCs) on thin cylinder grid graphs Cm × Pn+1 by studying a triangular variant of the problem. There are two types of HCs, distinguished by whether they wrap around the cylinder.
Bodroža-Pantić Olga +3 more
doaj +1 more source
A gerbe obstruction to quantization of fermions on odd dimensional manifolds with boundary [PDF]
, 1999 We consider the canonical quantization of fermions on an odd dimensional manifold with boundary, with respect to a family of elliptic hermitean boundary conditions for the Dirac hamiltonian.
Carey, Alan, Mickelsson, Jouko
core +6 more sources