401 - 410 of 3808 for FirstSearch Results
View search results from all Wolfram sites (8108 matches)
Eulerian   (Combinatorica Package Symbol)
Eulerian[n, k] gives the number of permutations of length n with k runs.
ExactRandomGraph   (Combinatorica Package Symbol)
ExactRandomGraph[n, e] constructs a random labeled graph of exactly e edges and n vertices.
ExtractCycles   (Combinatorica Package Symbol)
ExtractCycles[g] gives a maximal list of edge-disjoint cycles in graph g.
FerrersDiagram   (Combinatorica Package Symbol)
FerrersDiagram[p] draws a Ferrers diagram of integer partition p.
FindSet   (Combinatorica Package Symbol)
FindSet[n, s] gives the root of the set containing n in union-find data structure s.
FiniteGraphs   (Combinatorica Package Symbol)
FiniteGraphs produces a convenient list of all the interesting, finite, parameterless graphs built into Combinatorica.
FolkmanGraph   (Combinatorica Package Symbol)
FolkmanGraph returns a smallest graph that is edge-transitive but not vertex-transitive.
FruchtGraph   (Combinatorica Package Symbol)
FruchtGraph returns the smallest 3-regular graph whose automorphism group consists of only the identity.
GraphCenter   (Combinatorica Package Symbol)
GraphCenter[g] gives a list of the vertices of graph g with minimum eccentricity.
GraphDifference   (Combinatorica Package Symbol)
GraphDifference[g, h] constructs the graph resulting from subtracting the edges of graph h from the edges of graph g.
1 ... 38|39|40|41|42|43|44 ... 381 Previous Next

...