441 - 450 of 3808 for FirstSearch Results
View search results from all Wolfram sites (8108 matches)
MakeSimple   (Combinatorica Package Symbol)
MakeSimple[g] gives the undirected graph, free of multiple edges and self-loops derived from graph g.
MaximalMatching   (Combinatorica Package Symbol)
MaximalMatching[g] gives the list of edges associated with a maximal matching of graph g.
MaximumAntichain   (Combinatorica Package Symbol)
MaximumAntichain[g] gives a largest set of unrelated vertices in partial order g.
MaximumIndependentSet   (Combinatorica Package Symbol)
MaximumIndependentSet[g] finds a largest independent set of graph g.
MaximumSpanningTree   (Combinatorica Package Symbol)
MaximumSpanningTree[g] uses Kruskal's algorithm to find a maximum spanning tree of graph g.
McGeeGraph   (Combinatorica Package Symbol)
McGeeGraph returns the unique (7, 3)-cage, a 3-regular graph with girth 7.
MinimumChainPartition   (Combinatorica Package Symbol)
MinimumChainPartition[g] partitions partial-order g into a minimum number of chains.
MinimumChangePermutations   (Combinatorica Package Symbol)
MinimumChangePermutations[l] constructs all permutations of list l such that adjacent permutations differ by only one transposition.
MinimumVertexColoring   (Combinatorica Package Symbol)
MinimumVertexColoring[g] returns a minimum vertex coloring of g. MinimumVertexColoring[g, k] returns a k-coloring of g, if one exists.
MultipleEdgesQ   (Combinatorica Package Symbol)
MultipleEdgesQ[g] yields True if g has multiple edges between pairs of vertices. It yields False otherwise.
1 ... 42|43|44|45|46|47|48 ... 381 Previous Next

...