GroebnerBasis[{poly_1, poly_2, ...}, {x_1, x_2, ...}] gives a list of polynomials that form a Gröbner basis for the set of polynomials poly_i. GroebnerBasis[{poly_1, poly_2, ...
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.
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.