RandomGraph[n, p] constructs a random labeled graph on n vertices with an edge probability of p.

HerschelGraph returns a graph object that represents a Herschel graph.

M[g] gives the number of edges in the graph g. M[g, Directed] is obsolete because M[g] works for directed as well as undirected graphs.

Labeled[expr, lbl] displays expr labeled with lbl. Labeled[expr, lbl, pos] places lbl at a position specified by pos. Labeled[expr, {lbl_1, lbl_2, ...}, {pos_1, ...}] places ...

VertexInDegree[g] gives the list of vertex in-degrees for all vertices in the graph g.VertexInDegree[g, v] gives the vertex in-degree for the vertex v.

BetweennessCentrality[g] gives a list of betweenness centralities for the vertices in the graph g.

PermuteSubgraph[g, p] permutes the vertices of a subgraph of g induced by p according to p.

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

WheelGraph[n] gives the wheel graph with n vertices W_n.

ShowGraphArray[{g_1, g_2, ...}] displays a row of graphs. ShowGraphArray[{{g_1, ...}, {g_2, ...}, \ ...}] displays a two-dimensional table of graphs.