InvolutionQ[p] yields True if permutation p is its own inverse.

IsomorphismQ[g, h, p] tests if permutation p defines an isomorphism between graphs g and h.

Josephus[n, m] generates the inverse of the permutation defined by executing every m\[Null]^th member in a circle of n members.

LastLexicographicTableau[p] constructs the last Young tableau with shape described by partition p.

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

LineGraph[g] constructs the line graph of graph g.

LongestIncreasingSubsequence[p] finds the longest increasing scattered subsequence of permutation p.

LowerLeft is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.

LowerRight is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.

MakeSimple[g] gives the undirected graph, free of multiple edges and self-loops derived from graph g.