𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The spectrum of semi-Cayley graphs over abelian groups

✍ Scribed by Xing Gao; Yanfeng Luo


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
165 KB
Volume
432
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper, a formula of the spectrum of semi-Cayley graphs over finite abelian groups will be given. In particular, the spectrum of Cayley graphs over dihedral groups and dicyclic groups will be given, respectively.


πŸ“œ SIMILAR VOLUMES


On the Isomorphisms of Cayley Graphs of
✍ Yan-Quan Feng; Yan-Pei Liu; Ming-Yao Xu πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 190 KB

Let G be a finite group, S a subset of G=f1g; and let Cay ðG; SÞ denote the Cayley digraph of G with respect to S: If, for any subset T of G=f1g; CayðG; SÞ ffi CayðG; T Þ implies that S a ¼ T for some a 2 AutðGÞ; then S is called a CI-subset. The group G is called a CIM-group if for any minimal gene

The hamilton spaces of cayley graphs on
✍ Brian Alspach; Stephen C. Locke; Dave Witte πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 759 KB

The Hamilton cycles of a graph generate a subspace of the cycle space called the Hamilton space. The Hamilton space of any connected Cayley graph on an abelian group is determined in this paper.

Hamiltonian decompositions of Cayley gra
✍ Jiuqiang Liu πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 606 KB

Alspach has conjectured that any 2k-regular connected Cayley graph cay(A,S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S= {sl,sz, s3} is a minimal generating set of A with 1 Al odd, or S={sl,s& . . . . sk} is a genera

Connected Cayley graphs of semi-direct p
✍ Erich Durnberger πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 705 KB

In this paper it is shown that every connected Cayley graph of a semt-direct product of a cyclic group of prime order by an abelian group is hamiltonian. In particular, every connected Cayley graph of a group G is hamiltonian provided that G is of order greater than 2 and it contains a normal cyclic

Hamiltonian Decompositions of Cayley Gra
✍ Jiuqiang Liu πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 380 KB

Alspach has conjectured that any 2k-regular connected Cayley graph cay(A, S) on a finite abelian group A can be decomposed into k hamiltonian cycles. In this paper, the conjecture is shown to be true if S=[s 1 , s 2 , ..., s k ] is a minimal generating set of an abelian group A of odd order (where a