HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.
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.
TuranGraph[n, k] gives the k-partite Turán graph with n vertices T n, k.
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 ...