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, ...
HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.
KnightTourGraph[m, n] gives a Knight's tour graph on an m*n chessboard.
Most mathematical functions in Mathematica are set up to apply themselves separately to each element in a list. This is true in particular of all functions that carry the ...
This section is concerned with the way that CUDALink is set up and configured for your machine. It will also help to track down and correct problems. CUDALink is designed to ...
Some basic matrix operations. Transposing a matrix interchanges the rows and columns in the matrix. If you transpose an m×n matrix, you get an n×m matrix as the result. ...
The functional and list-oriented characteristics of the core Mathematica language allow CUDALink to provide immediate built-in data parallelism, automatically distributing ...
PetersenGraph[n, k] gives the generalized Petersen graph P n, k.
.NET/Link provides Mathematica users with the ability to interact with arbitrary .NET types directly from Mathematica. You can create objects and call methods and properties ...
Widget["Table"] represents a table.