GridGraph[{m, n}] gives the grid graph with m*n vertices G m, n.GridGraph[{n_1, n_2, ..., n_k}] gives the k-dimensional grid graph with n_1*n_2*\[CenterEllipsis]*n_k vertices ...
HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.
HyperbolicDistribution[\[Alpha], \[Beta], \[Delta], \[Mu]] represents a hyperbolic distribution with location parameter \[Mu], scale parameter \[Delta], shape parameter ...
IncidenceGraph[m] gives the graph with incidence matrix m.
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.
StarGraph[n] gives the star graph with n vertices S_n.
TuranGraph[n, k] gives the k-partite Turán graph with n vertices T n, k.