The number of edges on generalizations of Paley graphs
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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2001-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S0161171201002071 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|