the number of edges on generalizations of paley graphs
Clicks: 152
ID: 219719
2001
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
152 views
36 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #41 of 403 articles by views in structural engineering and mechanics
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 403 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
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.
| Reference Key |
sze2001internationalthe
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Lawrence Sze |
| Journal | structural engineering and mechanics |
| Year | 2001 |
| DOI |
10.1155/S0161171201002071
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.