FolkmanGraph returns a smallest graph that is edge-transitive but not vertex-transitive.

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

GrayCodeSubsets[l] constructs a binary reflected Gray code on set l.

GrayGraph returns a 3-regular, 54-vertex graph that is edge-transitive but not vertex-transitive\[LongDash]the smallest known such example.

HamiltonianPath[g] finds a Hamiltonian path in graph g if one exists. HamiltonianPath[g, All] gives all Hamiltonian paths of graph g.

HasseDiagram[g] constructs a Hasse diagram of the relation defined by directed acyclic graph g.

IcosahedralGraph returns the graph corresponding to the icosahedron, a Platonic solid.

InitializeUnionFind[n] initializes a union-find data structure for n elements.

LeviGraph returns the unique (8, 3)-cage, a 3-regular graph whose girth is 8.

LNorm[p] is a value that the option WeightingFunction, used in the function SetEdgeWeights, can take. Here p can be any integer or Infinity.