ToCanonicalSetPartition[sp, set] reorders sp into a canonical order with respect to set. ToCanonicalSetPartition[sp] reorders sp into canonical order, assuming that ...
ToOrderedPairs[g] constructs a list of ordered pairs representing the edges of the graph g.
ToUnorderedPairs[g] constructs a list of unordered pairs representing the edges of graph g. Each edge, directed or undirected, results in a pair in which the smaller vertex ...
TransitiveClosure[g] finds the transitive closure of graph g, the supergraph of g that contains edge {x, y} if and only if there is a path from x to y.
VertexColoring[g] uses Brelaz's heuristic to find a good, but not necessarily minimal, vertex coloring of graph g.
VertexConnectivity[g] gives the minimum number of vertices whose deletion from graph g disconnects it. VertexConnectivity[g, Cut] gives a set of vertices of minimum size ...
VertexCover[g] returns a vertex cover of the graph g.
VertexLabel is an option that can take on values True or False, allowing the user to set and display vertex labels.
VertexNumber is an option that can take on values True or False. This can be used in ShowGraph to display or suppress vertex numbers.
VertexNumberPosition is an option that can be used in ShowGraph to display a vertex number in a certain position relative to the vertex.