The number of edges on generalizations of Paley graphs

Sze, Lawrence

doi:https://doi.org/10.1155/S0161171201002071

International Journal of Mathematics and Mathematical Sciences

/ / Article

On this page

AbstractCopyrightRelated articles

Open Access

Volume 27 |Article ID 979064 | https://doi.org/10.1155/S0161171201002071

Lawrence Sze, "The number of edges on generalizations of Paley graphs", International Journal of Mathematics and Mathematical Sciences, vol. 27, Article ID 979064, 13 pages, 2001. https://doi.org/10.1155/S0161171201002071

The number of edges on generalizations of Paley graphs

Lawrence Sze¹

¹Department of Mathematics, California Polytechnic University, USA

Received21 Aug 1997

Abstract

Evans, Pulham, and Sheenan computed the number of complete 4-subgraphs of Paley graphs by counting the number of edges of the subgraph containing only those nodes x for which x and x−1 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

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.

No related content is available yet for this article.

PDF

Download Citation

Citation

Order printed copiesOrder

Downloads606

Citations