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.
Bounds on Mincut for Cayley Graphs over Abelian Groups
β Scribed by Vladimir Lipets
- Publisher
- Springer
- Year
- 2008
- Tongue
- English
- Weight
- 254 KB
- Volume
- 45
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we determine new bounds on the maximum number of vertices of a Cayley graph with fixed diameter and degree on an abelian group.
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
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 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.
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