Let G be a group generated by X. A Cayley graph ouer G is defined as a graph G(X) whose vertex set is G and whose edge set consists of all unordered pairs [a, b] with a, b E G and am'b E X U X-', where X-t denotes the set (x-t ( .x E X}. When X is a minimal generating set or each element of X is of
D-saturated property of the Cayley graphs of
β Scribed by Dong Yang; Xing Gao
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 265 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0037-1912
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let C be a conjugacy class in the alternating group A n , and let supp(C) be the number of nonfixed digits under the action of a permutation in C. For every 1>$>0 and n 5 there exists a constant c=c($)>0 such that if supp(C) $n then the undirected Cayley graph X(A n , C) is a c expander. A family of
where E(G) denotes the energy of G. The unitary Cayley graph X n has vertex set Z n = {0, 1, 2, . . . , n -1} and vertices a and b are adjacent, if gcd(ab, n) = 1. These graphs have integral spectrum and play an important role in modeling quantum spin networks supporting the perfect state transfer.