In this short note the neighbourhood graph of a Cayley graph is considered. It has, as nodes, a symmetric generating set of a finitely-generated group . Two nodes are connected by an edge if one is obtained from the other by multiplication on the right by one of the generators. Two necessary conditi
Cayley graphs of finite groups
โ Scribed by Paul-Hermann Zieschang
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 340 KB
- Volume
- 118
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Recently, Draper initiated the study of interconnection networks based on Cayley graphs of semidirect products of two cyclic groups called supertoroids. Interest in this class of graphs stems from their relatively smaller diameter compared to toroids of the same size. The Borel graphs introduced by
A Cayley graph Cay(G, S) of a group G is called a CI-graph if whenever T is another subset of G for which Cay(G, S) โผ = Cay(G, T ), there exists an automorphism ฯ of G such that S ฯ = T . For a positive integer m, the group G is said to have the m-CI property if all Cayley graphs of G of valency m a
The issue of when two Cayley digraphs on different abelian groups of prime power order can be isomorphic is examined. This had previously been determined by Anne Joseph for squares of primes; her results are extended.
The subject of this paper is the size of the largest component in random subgraphs of Cayley graphs, X n , taken over a class of p-groups, G n . G n consists of p-groups, G n , with the following properties: , where K is some positive constant. We consider Cayley graphs X n = (G n , S n ), where S
## Abstract If __n__ is divisible by at least three distinct primes, the dihedral group __D~n~__ can be generated by three nonredundant, involuntary elements. We study the Cayley graphs resulting from such a presentation of __D~n~__ for several families of __n__ and for all admissible __n__ < 120.