ChangeVertices[g, v] replaces the vertices of graph g with the vertices in the given list v. v can have the form {{x_1, y_1}, {x_2, y_2}, ...} or the form {{{x_1, y_1}, ...

DeleteEdge[g, e] gives graph g minus e. If g is undirected, then e is treated as an undirected edge; otherwise it is treated as a directed edge. If there are multiple edges ...

DeleteEdges[g, edgeList] gives graph g minus the list of edges edgeList. If g is undirected, then the edges in edgeList are treated as undirected edges; otherwise they are ...

DominationLattice[n] returns a Hasse diagram of the partially ordered set on integer partitions of n in which p < q if q dominates p. The function takes two options: Type and ...

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

InversionPoset[n] returns a Hasse diagram of the partially ordered set on size-n permutations in which p < q if q can be obtained from p by an adjacent transposition that ...

OrbitRepresentatives[pg, x] returns a representative of each orbit of x induced by the action of the group pg on x.

Orbits[pg, x] returns the orbits of x induced by the action of the group pg on x.

ToAdjacencyLists[g] constructs an adjacency list representation for graph g. ToAdjacencyLists[g, EdgeWeight] returns an adjacency list representation along with edge weights.

The functionality of PolynomialPowerMod is now available in the kernel function PolynomialRemainder. Modulus is now an option to the kernel functions PolynomialQuotient and ...