The number of edges on generalizations of Paley graphs
Evans, Pulham, and Sheenan computed the number of complete -subgraphs of Paley graphs by counting the number of edges of the subgraph containing only those nodes for which and are quadratic residues. Here we obtain formulae for the number of edges of generalizations of these subgraphs using Gaussian hypergeometric series and elliptic curves. Such formulae are simple in several infinite families, including those studied by Evans, Pulham, and Sheenan.
Copyright © 2001 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.