IntervalGraph[l] constructs the interval graph defined by the list of intervals l.

RandomTree[n] constructs a random labeled tree on n vertices.

RealizeDegreeSequence[s] constructs a semirandom graph with degree sequence s.

RegularGraph[k, n] constructs a semirandom k-regular graph on n vertices, if such a graph exists.

Wheel[n] constructs a wheel on n vertices, which is the join of CompleteGraph[1] and Cycle[n - 1].

Eigenvalues[m] gives a list of the eigenvalues of the square matrix m. Eigenvalues[{m, a}] gives the generalized eigenvalues of m with respect to a. Eigenvalues[m, k] gives ...

FindClusters[{e_1, e_2, ...}] partitions the e i into clusters of similar elements. FindClusters[{e_1 -> v_1, e_2 -> v_2, ...}] returns the v_i corresponding to the e i in ...

SchurDecomposition[m] yields the Schur decomposition for a numerical matrix m, given as a list {q, t} where q is an orthonormal matrix and t is a block upper-triangular ...

Ordering[list] gives the positions in list at which each successive element of Sort[list] appears. Ordering[list, n] gives the positions in list at which the first n elements ...

ItemSize is an option for Grid, Column, and related constructs that specifies the sizes to allow for items.