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.
DSolve
(Built-in Mathematica Symbol) DSolve[eqn, y, x] solves a differential equation for the function y, with independent variable x. DSolve[{eqn_1, eqn_2, ...}, {y_1, y_2, ...}, x] solves a list of ...
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.
HyperbolicDistribution[\[Alpha], \[Beta], \[Delta], \[Mu]] represents a hyperbolic distribution with location parameter \[Mu], scale parameter \[Delta], shape parameter ...
IncidenceGraph[m] gives the graph with incidence matrix m.
KaryTree[n] gives a binary tree with n vertices.KaryTree[n, k] gives a k-ary tree with n vertices.