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.
Integrate[f, x] gives the indefinite integral \[Integral]f d x. Integrate[f, {x, x_min, x_max}] gives the definite integral \[Integral]_x_min^x_max\ f\ d x. Integrate[f, {x, ...
KaryTree[n] gives a binary tree with n vertices.KaryTree[n, k] gives a k-ary tree with n vertices.
KnightTourGraph[m, n] gives a Knight's tour graph on an m*n chessboard.
ListLinePlot[{y_1, y_2, ...}] plots a line through a list of values, assumed to correspond to x coordinates 1, 2, .... ListLinePlot[{{x_1, y_1}, {x_2, y_2}, ...}] plots a ...
ListLogPlot[{y_1, y_2, ...}] makes a log plot of the y_i, assumed to correspond to x coordinates 1, 2, ....ListLogPlot[{{x_1, y_1}, {x_2, y_2}, ...}] makes a log plot of the ...