661 - 670 of 6981 for UsingSearch Results
View search results from all Wolfram sites (80371 matches)
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.
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.
PermutationType   (Combinatorica Package Symbol)
PermutationType[p] returns the type of permutation p.
PlanarQ   (Combinatorica Package Symbol)
PlanarQ[g] yields True if graph g is planar, meaning it can be drawn in the plane so no two edges cross.
PseudographQ   (Combinatorica Package Symbol)
PseudographQ[g] yields True if graph g is a pseudograph, meaning it contains self-loops.
Radius   (Combinatorica Package Symbol)
Radius[g] gives the radius of graph g, the minimum eccentricity of any vertex of g.
RandomComposition   (Combinatorica Package Symbol)
RandomComposition[n, k] constructs a random composition of integer n into k parts.
RandomKSubset   (Combinatorica Package Symbol)
RandomKSubset[l, k] gives a random subset of set l with exactly k elements.
1 ... 64|65|66|67|68|69|70 ... 699 Previous Next

...