FromUnorderedPairs[l] constructs an edge list representation from a list of unordered pairs l, using a circular embedding.FromUnorderedPairs[l, v] uses v as the embedding for ...

FruchtGraph returns the smallest 3-regular graph whose automorphism group consists of only the identity.

FunctionalGraph[f, v] takes a set v and a function f from v to v and constructs a directed graph with vertex set v and edges (x, f[x]) for each x in v. FunctionalGraph[{f_1, ...

GeneralizedPetersenGraph[n, k] returns the generalized Petersen graph, for integers n > 1 and k > 0, which is the graph with vertices {u_1, u_2, ..., u_n} and {v_1, v_2, ..., ...

GetEdgeLabels[g] returns the list of labels of the edges of g. GetEdgeLabels[g, e] returns the list of labels in graph g of the edges in e.

GetEdgeWeights[g] returns the list of weights of the edges of g. GetEdgeWeights[g, e] returns the list of weights in graph g of the edges in e.

GetVertexLabels[g] returns the list of labels of vertices of g. GetVertexLabels[g, v] returns the list of labels in graph g of the vertices specified in list v.

GetVertexWeights[g] returns the list of weights of vertices of g. GetVertexWeights[g, v] returns the list of weights in graph g of the vertices in v.

Girth[g] gives the length of a shortest cycle in a simple graph g.

GraphCenter[g] gives a list of the vertices of graph g with minimum eccentricity.