Cayley partitionable graphs and near-factorizations of finite groups
✍ Scribed by A. Pêcher
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 277 KB
- Volume
- 276
- Category
- Article
- ISSN
- 0012-365X
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
Recently, Draper initiated the study of interconnection networks based on Cayley graphs of semidirect products of two cyclic groups called supertoroids. Interest in this class of graphs stems from their relatively smaller diameter compared to toroids of the same size. The Borel graphs introduced by
A spectral set is a subset 0 of R n with Lebesgue measure 0<+(0)< such that there exists a set 4 of exponential functions which form an orthogonal basis of L 2 (0). The spectral set conjecture of B. Fuglede states that a set 0 is a spectral set if and only if 0 tiles R n by translation. We study set