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, ...
CycleGraph[n] gives the cycle graph with n vertices C_n.
HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.
HypercubeGraph[n] gives the n-dimensional hypercube graph Q_n.
KnightTourGraph[m, n] gives a Knight's tour graph on an m*n chessboard.
Lighting is an option for Graphics3D and related functions that specifies what simulated lighting to use in coloring 3D surfaces.
PetersenGraph[n, k] gives the generalized Petersen graph P n, k.
StarGraph[n] gives the star graph with n vertices S_n.
WaveletThreshold[dwd] thresholds the detail wavelet coefficients in the DiscreteWaveletData object dwd.WaveletThreshold[dwd, tspec] thresholds the coefficients using the ...
Mathematica provides representation of algebraic numbers as Root objects. A Root object contains the minimal polynomial of the algebraic number and the root number—an integer ...