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

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.

RandomGraph[{n, m}] gives a pseudorandom graph with n vertices and m edges.RandomGraph[{n, m}, k] gives a list of k pseudorandom graphs.RandomGraph[gdist, ...] samples from ...

StarGraph[n] gives the star graph with n vertices S_n.

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 ...

WheelGraph[n] gives the wheel graph with n vertices W_n.

Divisible[n, m] yields True if n is divisible by m, and yields False if it is not.

When summarizing data, it is often useful to analyze it by subgroup. For example, crop yields could be categorized by seed variety, or average patient recovery time by ...