6371 - 6380 of 8567 for roots of equationsSearch Results
View search results from all Wolfram sites (55063 matches)
MakeUndirected   (Combinatorica Package Symbol)
MakeUndirected[g] gives the underlying undirected graph of the given directed graph g.
MinimumSpanningTree   (Combinatorica Package Symbol)
MinimumSpanningTree[g] uses Kruskal's algorithm to find a minimum spanning tree of graph g.
MinimumVertexCover   (Combinatorica Package Symbol)
MinimumVertexCover[g] finds a minimum vertex cover of graph g.
M   (Combinatorica Package Symbol)
M[g] gives the number of edges in the graph g. M[g, Directed] is obsolete because M[g] works for directed as well as undirected graphs.
NumberOfTableaux   (Combinatorica Package Symbol)
NumberOfTableaux[p] uses the hook length formula to count the number of Young tableaux with shape defined by partition p.
OrientGraph   (Combinatorica Package Symbol)
OrientGraph[g] assigns a direction to each edge of a bridgeless, undirected graph g, so that the graph is strongly connected.
ParentsToPaths   (Combinatorica Package Symbol)
ParentsToPaths[l, i, j] takes a list of parents l and returns the path from i to j encoded in the parent list. ParentsToPaths[l, i] returns the paths from i to all vertices.
PartialOrderQ   (Combinatorica Package Symbol)
PartialOrderQ[g] yields True if the binary relation defined by edges of the graph g is a partial order, meaning it is transitive, reflexive, and antisymmetric. ...
PartitionQ   (Combinatorica Package Symbol)
PartitionQ[p] yields True if p is an integer partition. PartitionQ[n, p] yields True if p is a partition of n.
PetersenGraph   (Combinatorica Package Symbol)
PetersenGraph returns the Petersen graph, a graph whose vertices can be viewed as the size-2 subsets of a size-5 set with edges connecting disjoint subsets.
1 ... 635|636|637|638|639|640|641 ... 857 Previous Next

...