Cascade is a setting of ModulationType, an option of function FrequencyModulation.

AddEdge[g, e] returns a graph g with the new edge e added. e can have the form {a, b} or the form {{a, b}, options}.

CoarserSetPartitionQ[a, b] yields True if set partition b is coarser than set partition a; that is, every block in a is contained in some block in b.

CoxeterGraph gives a non-Hamiltonian graph with a high degree of symmetry such that there is a graph automorphism taking any path of length 3 to any other.

GreedyVertexCover[g] returns a vertex cover of graph g constructed using the greedy algorithm. This is a natural heuristic for constructing a vertex cover, but it can produce ...

MaximumClique[g] finds a largest clique in graph g. MaximumClique[g, k] returns a k-clique, if such a thing exists in g; otherwise it returns {}.

RootedEmbedding[g, v] constructs a rooted embedding of graph g with vertex v as the root. RootedEmbedding[g] constructs a rooted embedding with a center of g as the root.

ThomassenGraph returns a hypotraceable graph, a graph G that has no Hamiltonian path but whose subgraph G - v for every vertex v has a Hamiltonian path.

TwoColoring[g] finds a two-coloring of graph g if g is bipartite. It returns a list of the labels 1 and 2 corresponding to the vertices.

The functionality in Miscellaneous`Audio` is now available through the newly created Audio Package.