Results 81 to 90 of about 841,975 (192)
Cycle spectra of Hamiltonian graphs
Journal of Combinatorial Theory, Series B, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kevin G. Milans +4 more
openaire +1 more source
On hyper-Hamiltonian Cartesian product of undirected cycles [PDF]
Discrete Mathematics Letters, 2021 Zbigniew R. Bogdanowicz
doaj +1 more source
Multicolored parallelisms of Hamiltonian cycles
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hung-Lin Fu, Yuan-Hsun Lo
openaire +2 more sources
Arc-Disjoint Hamiltonian Cycles in Round Decomposable Locally Semicomplete Digraphs
Discussiones Mathematicae Graph Theory, 2018 Let D = (V,A) be a digraph; if there is at least one arc between every pair of distinct vertices of D, then D is a semicomplete digraph. A digraph D is locally semicomplete if for every vertex x, the out-neighbours of x induce a semicomplete digraph and ...
Li Ruijuan, Han Tingting
doaj +1 more source
Hamiltonicity and $\sigma$-hypergraphs
Theory and Applications of Graphs, 2014 We define and study a special type of hypergraph. A $\sigma$-hypergraph $H= H(n,r,q$ $\mid$ $\sigma$), where $\sigma$ is a partition of $r$, is an $r$-uniform hypergraph having $nq$ vertices partitioned into $ n$ classes of $q$ vertices each.
Christina Zarb
doaj +1 more source
Hamiltonian cycles in I–graphs
Electronic Notes in Discrete Mathematics, 2013 Abstract The I–graphs generalize the family of generalized Petersen graphs. We show that a connected I–graph which is not a generalized Petersen graph is Hamiltonian.
BONVICINI, Simona, Pisanski, Tomaž
openaire +3 more sources
When the Cartesian product of directed cycles is hyper-Hamiltonian [PDF]
Discrete Mathematics Letters, 2021 Zbigniew R. Bogdanowicz
doaj +1 more source
The Hamiltonian and Hypohamiltonian of Generalized Petersen Graph (GP_(n,9))
Jambura Journal of MathematicsThe study of Hamiltonian and Hypohamiltonian properties in the generalized Petersen graph GP_{n,k} is interesting due to the unique structure and characteristics of these graphs. The method employed in this study involves searching for Hamiltonian cycles
Susilawati Susilawati +3 more
doaj +1 more source
Bifurcation of Limit Cycles by Perturbing a Piecewise Linear Hamiltonian System
Abstract and Applied Analysis, 2013 This paper concerns limit cycle bifurcations by perturbing a piecewise linear Hamiltonian system. We first obtain all phase portraits of the unperturbed system having at least one family of periodic orbits.
Yanqin Xiong, Maoan Han
doaj +1 more source
Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples
Electronic Journal of Graph Theory and Applications, 2019 A very old problem in campanology is the search for peals. The latter can be thought of as a heavily constrained sequence of all possible permutations of a given size, where the exact nature of the constraints depends on which method of ringing is ...
Michael Haythorpe, Andrew Johnson
doaj +1 more source