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 ...
StarGraph[n] gives the star graph with n vertices S_n.
FrameStyle is an option for Graphics, Grid, and other constructs that specifies the style in which to draw frames.
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.
HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.
KnightTourGraph[m, n] gives a Knight's tour graph on an m*n chessboard.
TuranGraph[n, k] gives the k-partite Turán graph with n vertices T n, k.
WheelGraph[n] gives the wheel graph with n vertices W_n.
TreeGraph[{v_1, v_2, ...}, {u_1, u_2, ...}] yields a tree where u_i is the predecessor of v_i.TreeGraph[{e_1, e_2, ...}] yields a tree with edges e_j.TreeGraph[{v_1, v_2, ...