We study the graphs of various irreducible polynomials here. The number p is the number of field elements and n is the degree of the polynomial. Each page contains at most 12 graphs.