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
โฆ LIBER โฆ
Exceptional trivalent cayley graphs for dihedral groups
โ Scribed by David L. Powers
- Publisher
- John Wiley and Sons
- Year
- 1982
- Tongue
- English
- Weight
- 432 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
โฆ Synopsis
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. All these graphs are trivalent, bipartite, Hamiltonian, of girth 6, and are regular representations of their groups. For each n, the isomorphism classes are determined and the graphs are described by a simple code.
๐ SIMILAR VOLUMES
Neighbourhood Graphs of Cayley Graphs fo
โ
Markus Neuhauser
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 134 KB