ReflexiveQ[g] yields True if the adjacency matrix of g represents a reflexive binary relation.

RevealCycles[p] unveils the canonical hidden cycle structure of permutation p.

ReverseEdges[g] flips the directions of all edges in a directed graph.

SignaturePermutation[p] gives the signature of permutation p.

Spectrum[g] gives the eigenvalues of graph g.

TravelingSalesmanBounds[g] gives upper and lower bounds on a minimum-cost traveling salesman tour of graph g.

TriangleInequalityQ[g] yields True if the weights assigned to the edges of graph g satisfy the triangle inequality.

TutteGraph returns the Tutte graph, the first known example of a 3-connected, 3-regular, planar graph that is non-Hamiltonian.

UnrankGrayCodeSubset[n, l] gives the n\[Null]^th subset of list l, listed in Gray code order.

UnrankKSubset[m, k, l] gives the m\[Null]^th k-subset of set l, listed in lexicographic order.