ListNecklaces[n, c, Cyclic] returns all distinct necklaces whose beads are colored by colors from c. Here c is a list of n, not necessarily distinct colors, and two colored ...

NumberOfNecklaces[n, nc, Cyclic] returns the number of distinct ways in which an n-bead necklace can be colored with nc colors, assuming that two colorings are equivalent if ...

ShortestPath[g, start, end] finds a shortest path between vertices start and end in graph g.

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

ToOrderedPairs[g] constructs a list of ordered pairs representing the edges of the graph g.

VertexColoring[g] uses Brelaz's heuristic to find a good, but not necessarily minimal, vertex coloring of graph g.

VertexCover[g] returns a vertex cover of the graph g.

ConvexHullMedian[{{x_1, y_1}, ..., {x_n, y_n}}] estimates the median to be the mean of the bivariate data points lying on the innermost layer of the convex layers of the data.

ReplaceAllUnheld[expr, rules] applies a rule or list of rules in an attempt to transform each subpart of expr that would be automatically evaluated.

RemoveSinks is an option of PageRanks, PageRankVector, LinkRanks and LinkRankMatrix that specifies whether sinks are removed by linking with all vertices.