Cyclotomic graphs and perfect codes |
| |
Authors: | Sanming Zhou |
| |
Institution: | School of Mathematics and Statistics, The University of Melbourne, Parkville, VIC 3010, Australia |
| |
Abstract: | We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of , with connection sets and , respectively, where () is an mth primitive root of unity, A a nonzero ideal of , and ? Euler's totient function. We call them the mth cyclotomic graph and the second kind mth cyclotomic graph, and denote them by and , respectively. We give a necessary and sufficient condition for to be a perfect t-code in and a necessary condition for to be such a code in , where is an integer and D an ideal of containing A. In the case when , is known as an Eisenstein–Jacobi and Gaussian networks, respectively, and we obtain necessary conditions for to be a perfect t-code in , where with β dividing α. In the literature such conditions are known to be sufficient when and under an additional condition. We give a classification of all first kind Frobenius circulants of valency 2p and prove that they are all pth cyclotomic graphs, where p is an odd prime. Such graphs belong to a large family of Cayley graphs that are efficient for routing and gossiping. |
| |
Keywords: | 05C25 68M10 94A99 |
本文献已被 ScienceDirect 等数据库收录! |
|