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, ...
IncidenceGraph[m] gives the graph with incidence matrix m.
KirchhoffGraph[kmat] gives the graph with Kirchhoff matrix kmat.KirchhoffGraph[{v_1, v_2, ...}, kmat] gives the graph with vertices v_i and Kirchhoff matrix kmat.
KnightTourGraph[m, n] gives a Knight's tour graph on an m*n chessboard.
PetersenGraph[n, k] gives the generalized Petersen graph P n, k.
TuranGraph[n, k] gives the k-partite Turán graph with n vertices T n, k.
Every new version of Mathematica contains many new features. But careful design from the outset has allowed nearly total compatibility to be maintained between all versions. ...
This section discusses commands that get information about database columns. If you find that the examples in this section do not work as shown, you may need to install or ...
CUDA is a general C-like programming developed by NVIDIA to program Graphical Processing Units (GPUs). CUDALink provides an easy interface to program the GPU by removing many ...
Transformation rules in Mathematica let you set local values for symbols, functions, and all other types of expressions. Using rules provides a powerful and extensible method ...