Generalized Input (Mathematica Tutorial)

The fundamental paradigm of most computer languages, including Mathematica, is that input is given and processed into output. Historically, such input has consisted of ...

Variables and Starting Conditions (Mathematica Tutorial)

All the functions FindMinimum, FindMaximum, and FindRoot take variable specifications of the same form. The function FindFit uses the same form for its parameter ...

CirculantGraph (Built-in Mathematica Symbol)

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 (Built-in Mathematica Symbol)

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 (Built-in Mathematica Symbol)

CompleteKaryTree[n] gives the complete binary tree with n levels.CompleteKaryTree[n, k] gives the complete k-ary tree with n levels.

DeBruijnGraph (Built-in Mathematica Symbol)

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.

GridGraph (Built-in Mathematica Symbol)

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 (Built-in Mathematica Symbol)

HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.

KaryTree (Built-in Mathematica Symbol)

KaryTree[n] gives a binary tree with n vertices.KaryTree[n, k] gives a k-ary tree with n vertices.

KnightTourGraph (Built-in Mathematica Symbol)

KnightTourGraph[m, n] gives a Knight's tour graph on an m*n chessboard.