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

FromInversionVector[v] reconstructs the unique permutation with inversion vector v.

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

GraphComplement[g] gives the complement of graph g.

GraphDifference[g, h] constructs the graph resulting from subtracting the edges of graph h from the edges of graph g.

GraphIntersection[g_1, g_2, ...] constructs the graph defined by the edges that are in all the graphs g_1, g_2, ....

GraphProduct[g_1, g_2, ...] constructs the product of graphs g_1, g_2, and so forth.

GrayCodeKSubsets[l, k] generates k-subsets of l in Gray code order.

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.