FindGraphIsomorphism[g_1, g_2] finds an isomorphism that maps the graph g_1 to g_2 by renaming vertices.
IdentityMatrix[n] gives the n*n identity matrix.
IndependentVertexSetQ[g, vlist] yields True if the vertex list vlist is an independent vertex set in the graph g and False otherwise.
LineGraph[g] gives the line graph of the graph g.
NormalizedSquaredEuclideanDistance[u, v] gives the normalized squared Euclidean distance between vectors u and v.
RandomInteger[{i_min, i_max}] gives a pseudorandom integer in the range {i_min, i_max}. RandomInteger[i_max] gives a pseudorandom integer in the range {0, ...
RandomPrime[{i_min, i_max}] gives a pseudorandom prime number in the range i_min to i_max.RandomPrime[i_max] gives a pseudorandom prime number in the range 2 to ...
SquaredEuclideanDistance[u, v] gives the squared Euclidean distance between vectors u and v.
Subfactorial[n] gives the number of permutations of n objects that leave no object fixed.
Functions for constructing matrices. This generates a 2×2 matrix whose i,j^th entry is a[i,j]. Here is another way to produce the same matrix.