ButterflyGraph[n] returns the n-dimensional butterfly graph, a directed graph whose vertices are pairs (w, i), where w is a binary string of length n and i is an integer in ...
FromAdjacencyMatrix[m] constructs a graph from a given adjacency matrix m, using a circular embedding. FromAdjacencyMatrix[m, v] uses v as the embedding for the resulting ...
FunctionalGraph[f, v] takes a set v and a function f from v to v and constructs a directed graph with vertex set v and edges (x, f[x]) for each x in v. FunctionalGraph[{f_1, ...
MakeGraph[v, f] constructs the graph whose vertices correspond to v and edges between pairs of vertices x and y in v for which the binary relation defined by the Boolean ...
NetworkFlow[g, source, sink] returns the value of a maximum flow through graph g from source to sink. NetworkFlow[g, source, sink, Edge] returns the edges in g that have ...
PairGroupIndex[g, x] returns the cycle index of the pair group induced by g as a polynomial in x[1], x[2], ....PairGroupIndex[ci, x] takes the cycle index ci of a group g ...
RankedEmbedding[l] takes a set partition l of vertices {1, 2, ..., n} and returns an embedding of the vertices in the plane such that the vertices in each block occur on a ...
SetGraphOptions[g, opts] returns g with the options opts set. SetGraphOptions[g, {v_1, v_2, ..., v_opts}, g_opts] returns the graph with the options v_opts set for vertices ...
ShowGraph[g] displays the graph g. ShowGraph[g, Directed] is obsolete and it is currently identical to ShowGraph[g].
PlanarGraphPlot[{{x_1, y_1}, {x_2, y_2}, ...}] plots the Delaunay triangulation of the points {{x_1, y_1}, ...}.PlanarGraphPlot[{{x_1, y_1}, {x_2, y_2}, ...}, g] plots the ...