Hash functions and Cayley graphs
✍ Scribed by Gilles Zémor
- Publisher
- Springer
- Year
- 1994
- Tongue
- English
- Weight
- 659 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0925-1022
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract For any __d__⩾5 and __k__⩾3 we construct a family of Cayley graphs of degree __d__, diameter __k__, and order at least __k__((__d__−3)/3)^__k__^. By comparison with other available results in this area we show that our family gives the largest currently known Cayley graphs for a wide ra
A graph G is said to be hom-idempotent if there is a homomorphism from G 2 to G, and weakly hom-idempotent if for some n ≥ 1 there is a homomorphism from G n+1 to G n . We characterize both classes of graphs in terms of a special class of Cayley graphs called normal Cayley graphs. This allows us to