Cayley digraphs and graphs
โ Scribed by Delorme, Charles
- Book ID
- 120663751
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 484 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced
## Abstract Let __Z__~__p__~ denote the cyclic group of order __p__ where __p__ is a prime number. Let __X__ = __X__(__Z__~__p__~, __H__) denote the Cayley digraph of __Z__~__p__~ with respect to the symbol __H__. We obtain a necessary and sufficient condition on __H__ so that the complete graph on
Given a colouring A of a d-regular digraph G and a colouring H of the symmetric complete digraph on d vertices with loops, the uniformly induced colouring LnA of the line digraph LG is defined. It is shown that the group of colour-preserving automorphisms of (LG, L,A) is a subgroup of the group of c