The Mathematica compiler can run computations in parallel. It does this by threading a compiled function over lists of data in parallel. A first step is to create a compiled ...
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, ...
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.
HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.
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.
PathGraph[{v_1, v_2, ...}] yields a path with vertices v_i and edges between v_i and v i +\[ThinSpace]1 .PathGraph[{e_1, e_2, ...}] yields a path with edges ...
PetersenGraph[n, k] gives the generalized Petersen graph P n, k.
Widget["Table"] represents a table.