461 - 470 of 3808 for FirstSearch Results
View search results from all Wolfram sites (8108 matches)
NoPerfectMatchingGraph   (Combinatorica Package Symbol)
NoPerfectMatchingGraph returns a connected graph with 16 vertices that contains no perfect matching.
NthSubset   (Combinatorica Package Symbol)
NthSubset[n, l] gives the n\[Null]^th subset of list l in canonical order.
NumberOf2Paths   (Combinatorica Package Symbol)
NumberOf2Paths[g, v] returns a sorted list that contains the number of paths of length 2 to different vertices of g from v.
NumberOfCompositions   (Combinatorica Package Symbol)
NumberOfCompositions[n, k] counts the number of distinct compositions of integer n into k parts.
NumberOfDerangements   (Combinatorica Package Symbol)
NumberOfDerangements[n] counts the derangements on n elements, that is, the permutations without any fixed points.
NumberOfSpanningTrees   (Combinatorica Package Symbol)
NumberOfSpanningTrees[g] gives the number of labeled spanning trees of graph g.
One   (Combinatorica Package Symbol)
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   (Combinatorica Package Symbol)
PermutationGraph[p] gives the permutation graph for the permutation p.
PermutationGroupQ   (Combinatorica Package Symbol)
PermutationGroupQ[l] yields True if the list of permutations l forms a permutation group.
PermutationToTableaux   (Combinatorica Package Symbol)
PermutationToTableaux[p] returns the tableaux pair that can be constructed from p using the Robinson\[Dash]Schensted\[Dash]Knuth correspondence.
1 ... 44|45|46|47|48|49|50 ... 381 Previous Next

...