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

AlternatingGroupIndex[n, x] gives the cycle index of the alternating group of size n permutations as a polynomial in the symbols x[1], x[2], ..., x[n]}.

BiconnectedComponents[g] gives a list of the biconnected components of graph g. If g is directed, the underlying undirected graph is used.

Bridges[g] gives a list of the bridges of graph g, where each bridge is an edge whose removal disconnects the graph.

ChromaticPolynomial[g, z] gives the chromatic polynomial P(z) of graph g, which counts the number of ways to color g with, at most, z colors.

CodeToLabeledTree[l] constructs the unique labeled tree on n vertices from the Prüfer code l, which consists of a list of n - 2 integers between 1 and n.

Compositions[n, k] gives a list of all compositions of integer n into k parts.

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.

CycleIndex[pg, x] returns the polynomial in x[1], x[2], ..., x[index[pg]] that is the cycle index of the permutation group pg. Here index[pg] refers to the length of each ...

DilateVertices[v, d] multiplies each coordinate of each vertex position in list v by d, thus dilating the embedding. DilateVertices[g, d] dilates the embedding of graph g by ...