CompleteKaryTree[n] gives the complete binary tree with n levels.CompleteKaryTree[n, k] gives the complete k-ary tree with n levels.
GraphCenter[g] gives the set of vertices with minimum eccentricity in the graph g.
GraphDisjointUnion[g_1, g_2] gives the graph disjoint union of the graphs g_1 and g_2.GraphDisjointUnion[g_1, g_2, ...] gives the disjoint union of g_1, g_2, ....
SectorOrigin is an option to PieChart and related functions that specifies where sectors should start.
TuranGraph[n, k] gives the k-partite TurĂ¡n graph with n vertices T n, k.
PetersenGraph[n, k] gives the generalized Petersen graph P n, k.
KnightTourGraph[m, n] gives a Knight's tour graph on an m*n chessboard.
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 ...
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.
PolarAxes is an option for sector charts and polar plots that specifies whether polar axes should be drawn.