English
Related papers

Related papers: Cayley graphs of order 27p are hamiltonian

200 papers

Suppose G is a finite group of order 30p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

Combinatorics · Mathematics 2012-07-03 Ebrahim Ghaderpour , Dave Witte Morris

Suppose G is a finite group, such that |G| = 16p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

Combinatorics · Mathematics 2011-04-05 Stephen J. Curran , Dave Witte Morris , Joy Morris

Assume G is a finite group, such that |G|= 6pq or 7pq, where p and q are distinct prime numbers, and let S be a generating set of G. We prove there is a Hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

Combinatorics · Mathematics 2025-09-30 Farzad Maghsoudi

We show that if G is a finite group whose commutator subgroup [G,G] has order 2p, where p is an odd prime, then every connected Cayley graph on G has a hamiltonian cycle.

Combinatorics · Mathematics 2017-03-21 Dave Witte Morris

We give a computer-assisted proof that if $G$ is a finite group of order $8pq$, where $p$ and $q$ are distinct primes, then every connected Cayley graph on $G$ has a hamiltonian cycle.

Combinatorics · Mathematics 2026-04-21 Fateme Abedi , Dave Witte Morris , Javanshir Rezaee , M. Reza Salarian

We prove that if Cay(G;S) is a connected Cayley graph with n vertices, and the prime factorization of n is very small, then Cay(G;S) has a hamiltonian cycle. More precisely, if p, q, and r are distinct primes, then n can be of the form kp…

Combinatorics · Mathematics 2015-03-17 K. Kutnar , D. Marusic , D. W. Morris , J. Morris , P. Sparl

Let $G$ be a finite group. We show that if $|G| = pqrs$, where $p$, $q$, $r$, and $s$ are distinct odd primes, then every connected Cayley graph on $G$ has a hamiltonian cycle.

Combinatorics · Mathematics 2021-08-02 Dave Witte Morris

This note shows there are infinitely many finite groups G, such that every connected Cayley graph on G has a hamiltonian cycle, and G is not solvable. Specifically, for every prime p that is congruent to 1, modulo 30, we show there is a…

Combinatorics · Mathematics 2015-07-20 Dave Witte Morris

We provide a computer-assisted proof that if G is any finite group of order kp, where k < 48 and p is prime, then every connected Cayley graph on G is hamiltonian (unless kp = 2). As part of the proof, it is verified that every connected…

Combinatorics · Mathematics 2023-04-04 Dave Witte Morris , Kirsten Wilk

We show that if G is a nontrivial, finite group of odd order, whose commutator subgroup [G,G] is cyclic of order p^m q^n, where p and q are prime, then every connected Cayley graph on G has a hamiltonian cycle.

Combinatorics · Mathematics 2012-05-02 Dave Witte Morris

We show that if G is any nilpotent, finite group, and the commutator subgroup of G is cyclic, then every connected Cayley graph on G has a hamiltonian cycle.

Combinatorics · Mathematics 2011-11-29 Ebrahim Ghaderpour , Dave Witte Morris

We construct an infinite family of connected, 2-generated Cayley digraphs Cay(G;a,b) that do not have hamiltonian paths, such that the orders of the generators a and b are arbitrarily large. We also prove that if G is any finite group with…

Combinatorics · Mathematics 2013-06-25 Dave Witte Morris

Generalizing a result of Conway, Sloane, and Wilkes for real reflection groups, we show the Cayley graph of an imprimitive complex reflection group with respect to standard generating reflections has a Hamiltonian cycle. This is consistent…

Combinatorics · Mathematics 2014-03-05 Cathy Kriloff , Terry Lay

Suppose G is a nilpotent, finite group. We show that if {a,b} is any 2-element generating set of G, then the corresponding Cayley digraph Cay(G;a,b) has a hamiltonian path. This implies there is a hamiltonian path in every connected Cayley…

Combinatorics · Mathematics 2011-07-04 Dave Witte Morris

A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex-transitive graphs with finitely many ends, and also discuss…

Combinatorics · Mathematics 2023-04-20 Babak Miraftab , Dave Witte Morris

If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…

Group Theory · Mathematics 2024-03-21 Paul-Henry Leemann , Mikael de la Salle

In this note, we give the Hamiltonian decomposition of the Cayley graph on the dihedral group $D_{2p}$ where $p$ is a prime.

Combinatorics · Mathematics 2018-10-19 Hui Zhou , Liufeng Xu , Yang Cui , Qi Ding , Yanfeng Luo , Xing Gao , Dong Yang

We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric group. There are two main theorems in this paper. The first…

Combinatorics · Mathematics 2007-11-21 Jacob Steinhardt

In this paper, generalized Cayley graphs are studied. It is proved that every generalized Cayley graph of order 2p is a Cayley graph, where p is a prime. Special attention is given to generalized Cayley graphs on Abelian groups. It is…

Combinatorics · Mathematics 2015-12-02 Ademir Hujdurović , Klavdija Kutnar , Pawel Petecki , Anastasiya Tanana

In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this result to the infinite case. Additionally, we generalize…

Combinatorics · Mathematics 2024-12-12 Florian Lehner , Farzad Maghsoudi , Babak Miraftab
‹ Prev 1 2 3 10 Next ›