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
Which finitely generated Abelian groups admit isomorphic Cayley graphs?
✍ Scribed by Clara Löh
- Book ID
- 121479809
- Publisher
- Springer
- Year
- 2012
- Tongue
- English
- Weight
- 275 KB
- Volume
- 164
- Category
- Article
- ISSN
- 0046-5755
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
We show every finitely-generated, infinite abeliar\_ group (i.e. Zn x G where G is a finite abelian group) has a minimal generating set for which the Cayley digraph has a two-way in&rite hamiltonian path, and if n 2 2, then this Cayley digraph also has a one-way infinite hamiltonian path. We show fu