GraphTheory[SpecialGraphs][PayleyGraph]
|
Calling Sequence
|
|
PayleyGraph(p)
PayleyGraph(p,k)
PayleyGraph(p,k,m)
|
|
Parameters
|
|
p
|
-
|
prime integer
|
k
|
-
|
positive integer
|
m
|
-
|
irreducible univariate polynomial of degree k over GF(p)
|
|
|
|
|
Description
|
|
•
|
If the input is PayleyGraph(p) then the output is an undirected unweighted simple graph G on p vertices labeled 0,1,...,p-1 where the edge {i,j}, with i<j, is in G iff j-i is a quadratic residue in Zp.
|
•
|
The field can be specified by specifying the extension polynomial by the user by specifying the extension polynomial for GF(q), a monic irreducible polynomial m(x) in Zp[x] of degree k.
|
|
|
Examples
|
|
>
|
|
>
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
>
|
|
| (4) |
>
|
|
| (5) |
>
|
|
|
|
Download Help Document
Was this information helpful?