中文
相关论文

相关论文: Odd-order Cayley graphs with commutator subgroup o…

200 篇论文

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.

组合数学 · 数学 2017-03-21 Dave Witte Morris

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.

组合数学 · 数学 2021-08-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.

组合数学 · 数学 2011-11-29 Ebrahim Ghaderpour , 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.

组合数学 · 数学 2026-04-21 Fateme Abedi , Dave Witte Morris , Javanshir Rezaee , M. Reza Salarian

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).

组合数学 · 数学 2025-09-30 Farzad Maghsoudi

It has been shown that there is a Hamilton cycle in every connected Cayley graph on each group G whose commutator subgroup is cyclic of prime-power order. This paper considers connected, vertex-transitive graphs X of order at least 3 where…

组合数学 · 数学 2016-09-07 Edward Dobson , Heather Gavlas , Joy Morris , Dave Witte

Suppose G is a finite group, such that |G| = 27p, 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).

组合数学 · 数学 2011-04-22 Ebrahim Ghaderpour , Dave Witte Morris

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).

组合数学 · 数学 2012-07-03 Ebrahim Ghaderpour , Dave Witte Morris

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…

组合数学 · 数学 2024-12-12 Florian Lehner , Farzad Maghsoudi , Babak Miraftab

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…

组合数学 · 数学 2015-07-20 Dave Witte Morris

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…

组合数学 · 数学 2015-03-17 K. Kutnar , D. Marusic , D. W. Morris , J. Morris , P. Sparl

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).

组合数学 · 数学 2011-04-05 Stephen J. Curran , Dave Witte Morris , Joy 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…

组合数学 · 数学 2014-03-05 Cathy Kriloff , Terry Lay

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…

组合数学 · 数学 2023-04-20 Babak Miraftab , 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…

组合数学 · 数学 2023-04-04 Dave Witte Morris , Kirsten Wilk

In this note we prove that all connected Cayley graphs of every finite group $Q \times H$ are 1-factorizable, where $Q$ is any non-trivial group of 2-power order and $H$ is any group of odd order.

组合数学 · 数学 2007-05-23 Alireza Abdollahi

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…

组合数学 · 数学 2013-06-25 Dave Witte Morris

Let $\Gamma=\mathrm{Cay}(G,S)$ be a Cayley digraph on a group $G$ and let $A=\mathrm{Aut}(\Gamma)$. The Cayley index of $\Gamma$ is $|A:G|$. It has previously been shown that, if $p$ is a prime, $G$ is a cyclic $p$-group and $A$ contains a…

组合数学 · 数学 2017-03-08 Luke Morgan , Joy Morris , Gabriel Verret

A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. A non-abelian group is called an inner-abelian group if all of its proper subgroups are…

组合数学 · 数学 2017-01-05 Yan-Li Qin , Jin-Xin Zhou

A graph $\Ga=(V,E)$ is called a Cayley graph of some group $T$ if the automorphism group $\Aut(\Ga)$ contains a subgroup $T$ which acts on regularly on $V$. If the subgroup $T$ is normal in $\Aut(\Ga)$ then $\Ga$ is called a normal Cayley…

群论 · 数学 2021-04-01 Jing Jian Li , Zai Ping Lu
‹ 上一页 1 2 3 10 下一页 ›