FromAdjacencyLists[l] constructs an edge list representation for a graph from the given adjacency lists l, using a circular embedding. FromAdjacencyLists[l, v] uses v as the ...

FromOrderedPairs[l] constructs an edge list representation from a list of ordered pairs l, using a circular embedding. FromOrderedPairs[l, v] uses v as the embedding for the ...

FromUnorderedPairs[l] constructs an edge list representation from a list of unordered pairs l, using a circular embedding.FromUnorderedPairs[l, v] uses v as the embedding for ...

GraphPolynomial[n, x] returns a polynomial in x in which the coefficient of x^m is the number of nonisomorphic graphs with n vertices and m edges. GraphPolynomial[n, x, ...

GridGraph[n, m] constructs an n*m grid graph, the product of paths on n and m vertices. GridGraph[p, q, r] constructs a p*q*r grid graph, the product of GridGraph[p, q] and a ...

MakeDirected[g] constructs a directed graph from a given undirected graph g by replacing each undirected edge in g by two directed edges pointing in opposite directions.

RandomGraph[n, p] constructs a random labeled graph on n vertices with an edge probability of p.

ShortestPath[g, start, end] finds a shortest path between vertices start and end in graph g.

ShuffleExchangeGraph[n] returns the n-dimensional shuffle-exchange graph whose vertices are length n binary strings with an edge from w to Derivative[1][w] if (i) ...

ToCanonicalSetPartition[sp, set] reorders sp into a canonical order with respect to set. ToCanonicalSetPartition[sp] reorders sp into canonical order, assuming that ...