PetersenGraph[n, k] gives the generalized Petersen graph P n, k.

WeightedAdjacencyGraph[wmat] gives the graph with weighted adjacency matrix wmat.WeightedAdjacencyGraph[{v_1, v_2, ...}, wmat] gives the graph with vertices v_i and weighted ...

StepMonitor is an option for iterative numerical computation functions that gives an expression to evaluate whenever a step is taken by the numerical method used.

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

Invariants is an option to the functions Isomorphism and IsomorphicQ that informs these functions about which vertex invariants to use in computing equivalences between ...

One is a tag used in several functions to inform the functions that only one object need be considered or only one solution be produced, as opposed to all objects or all ...

FinishDynamic[] finishes updating and displaying all currently visible Dynamic objects.

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.

VertexLabeling is an option for GraphPlot and related functions which specifies whether labeling should be included by default for vertices in graphs.

The Mathematica compiler provides an important way both to speed up and to work with Mathematica computations. It does this by taking assumptions about the computations and ...