Cayley graphs and group presentations
Published online by Cambridge University Press: 24 October 2008
Extract
The aim of this paper is to prove the following result:
Theorem. Let G be the group defined by the presentation
where each ui is a word in the xj and , and suppose that there is a homomorphism σ such that the orders of the elements respectively. Let If G is finite, then α−d + 1 > 0 and .
- Type
- Research Article
- Information
- Mathematical Proceedings of the Cambridge Philosophical Society , Volume 103 , Issue 3 , May 1988 , pp. 385 - 387
- Copyright
- Copyright © Cambridge Philosophical Society 1988
References
REFERENCES
- 7
- Cited by