NoPerfectMatchingGraph returns a connected graph with 16 vertices that contains no perfect matching.

NthSubset[n, l] gives the n\[Null]^th subset of list l in canonical order.

NumberOf2Paths[g, v] returns a sorted list that contains the number of paths of length 2 to different vertices of g from v.

NumberOfCompositions[n, k] counts the number of distinct compositions of integer n into k parts.

NumberOfDerangements[n] counts the derangements on n elements, that is, the permutations without any fixed points.

NumberOfSpanningTrees[g] gives the number of labeled spanning trees of graph g.

One is a tag used in several functions to inform the functions that only one object need be considered or only one solution be produced, as opposed to all objects or all ...

PermutationGraph[p] gives the permutation graph for the permutation p.

PermutationGroupQ[l] yields True if the list of permutations l forms a permutation group.

PermutationToTableaux[p] returns the tableaux pair that can be constructed from p using the Robinson\[Dash]Schensted\[Dash]Knuth correspondence.