HypercubeGraph[n] gives the n-dimensional hypercube graph Q_n.
SmoothHistogram3D[{{x_1, y_1}, {x_2, y_2}, ...}] plots a 3D smooth kernel histogram of the values {x_i, y_i}.SmoothHistogram3D[{{x_1, y_1}, {x_2, y_2}, ...}, espec] plots a ...
The control mechanisms set up for NDSolve enable you to define your own numerical integration algorithms and use them as specifications for the Method option of NDSolve. ...
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, ...
CompleteGraph[n] gives the complete graph with n vertices K_n.CompleteGraph[{n_1, n_2, ..., n_k}] gives the complete k-partite graph with n_1 + n_2 + \[CenterEllipsis] + n_k ...
CompleteKaryTree[n] gives the complete binary tree with n levels.CompleteKaryTree[n, k] gives the complete k-ary tree with n levels.
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.
GridGraph[{m, n}] gives the grid graph with m*n vertices G m, n.GridGraph[{n_1, n_2, ..., n_k}] gives the k-dimensional grid graph with n_1*n_2*\[CenterEllipsis]*n_k vertices ...
HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.