## Abstract A graph is representable modulo __n__ if its vertices can be labeled with distinct integers between 0 and __n__, the difference of the labels of two vertices being relatively prime to __n__ if and only if the vertices are adjacent. ErdΕs and Evans recently proved that every graph is rep
Quadratic modulo 2n Cayley graphs
β Scribed by Reinaldo E. Giudici; Aurora A. Olivieri
- Book ID
- 108316404
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 83 KB
- Volume
- 215
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We use a telescoping method suggested by Ono [5] to compute p(n) (mod l) as a weighted sum over l-affine partitions of size n. When l=2, 3, 5, 7, and 11, these sums are neatly described using binary quadratic forms. Moreover, one immediately obtains classical proofs of the Ramanujan congruences (mod
A graph G is 2-extendable if any two independent edges of G are contained in a perfect matching of G. A Cayley graph of even order over an abelian group is 2-extendable if and only if it is not isomorphic to any of the following circulant graphs: (I) Z2.(1,2n -1), n >~ 3; (II) ZE.(1,2,2n -1,2n -2),