MaximumSpanningTree[g] uses Kruskal's algorithm to find a maximum spanning tree of graph g.

NumberOf2Paths[g, v] returns a sorted list that contains the number of paths of length 2 to different vertices of g from v.

OctahedralGraph returns the graph corresponding to the octahedron, a Platonic solid.

Permute[l, p] permutes list l according to permutation p.

RandomVertices[g] assigns a random embedding to graph g.

RankGraph[g, l] partitions the vertices into classes based on the shortest geodesic distance to a member of list l.

ResidualFlowGraph[g, flow] returns the directed residual flow graph for graph g with respect to flow.

SelfComplementaryQ[g] yields True if graph g is self-complementary, meaning it is isomorphic to its complement.

TetrahedralGraph returns the graph corresponding to the tetrahedron, a Platonic solid.

TriangleInequalityQ[g] yields True if the weights assigned to the edges of graph g satisfy the triangle inequality.