The number of edges on generalizations of Paley graphs

Lawrence Sze

International Journal of Mathematics and Mathematical Sciences, 2001, vol. 27, 1-13

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.

Date: 2001
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/27/979064.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/27/979064.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:979064

DOI: 10.1155/S0161171201002071

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().