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.

SamenessRelation[l] constructs a binary relation from a list l of permutations, which is an equivalence relation if l is a permutation group.

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.

All the functionality of Utilities`Notation` is now available in the newly created Notation Package.

CommunityModularity[g, partition] gives the community modularity of a partition.CommunityModularity[g, assignment] gives the community modularity of an assignment.

 

MeanDifferenceTest[list_1, list_2, \[CapitalDelta]\[Mu]_0] performs a test with null hypothesis \[Mu]_1 - \[Mu]_2 = \[CapitalDelta]\[Mu]_0.

CentsToHertz[{i_1, i_2, ...}] converts a list of intervals i_1, i_2, ..., measured in cents to a list of frequencies measured in Hertz, beginning at 440 ...