IsomorphismQ[g, h, p] tests if permutation p defines an isomorphism between graphs g and h.

TimeValue[s, i, t] calculates the time value of a security s at time t for an interest specified by i.

Combinatorica extends Mathematica by over 450 functions in combinatorics and graph theory. It includes functions for constructing graphs and other combinatorial objects, ...

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.

CompleteQ[g] yields True if graph g is complete. This means that between any pair of vertices there is an undirected edge or two directed edges going in opposite directions.

Distances[g, v] returns the distances in nondecreasing order from vertex v to all vertices in g, treating g as an unweighted graph.

Eccentricity[g] gives the eccentricity of each vertex v of graph g, the maximum length among all shortest paths from v.

EdgeChromaticNumber[g] gives the fewest number of colors necessary to color each edge of graph g, so that no two edges incident on the same vertex have the same color.

EquivalenceRelationQ[r] yields True if the matrix r defines an equivalence relation. EquivalenceRelationQ[g] tests whether the adjacency matrix of graph g defines an ...

GetEdgeLabels[g] returns the list of labels of the edges of g. GetEdgeLabels[g, e] returns the list of labels in graph g of the edges in e.