Analogues of Cayley graphs for topological groups
✍ Scribed by Bernhard Krön; Rögnvaldur G. Möller
- Publisher
- Springer-Verlag
- Year
- 2007
- Tongue
- French
- Weight
- 474 KB
- Volume
- 258
- Category
- Article
- ISSN
- 0025-5874
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
## 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.