CirculantGraph[n, j] gives the circulant graph with n vertices and jump j C_n (j).CirculantGraph[n, {j_1, j_2, ...}] gives the circulant graph with n vertices and jumps j_1, ...
DeBruijnGraph[m, n] gives the n-dimensional De Bruijn graph with m symbols.DeBruijnGraph[m, n, type] gives the De Bruijn graph with connectivity given by type.
DensityPlot[f, {x, x_min, x_max}, {y, y_min, y_max}] makes a density plot of f as a function of x and y.
HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.
KaryTree[n] gives a binary tree with n vertices.KaryTree[n, k] gives a k-ary tree with n vertices.
KirchhoffGraph[kmat] gives the graph with Kirchhoff matrix kmat.KirchhoffGraph[{v_1, v_2, ...}, kmat] gives the graph with vertices v_i and Kirchhoff matrix kmat.
KnightTourGraph[m, n] gives a Knight's tour graph on an m*n chessboard.
PetersenGraph[n, k] gives the generalized Petersen graph P n, k.
Plot
(Built-in Mathematica Symbol) Plot[f, {x, x_min, x_max}] generates a plot of f as a function of x from x_min to x_max. Plot[{f_1, f_2, ...}, {x, x_min, x_max}] plots several functions f_i.
RandomGraph[{n, m}] gives a pseudorandom graph with n vertices and m edges.RandomGraph[{n, m}, k] gives a list of k pseudorandom graphs.RandomGraph[gdist, ...] samples from ...