DeleteEdges[g, edgeList] gives graph g minus the list of edges edgeList. If g is undirected, then the edges in edgeList are treated as undirected edges; otherwise they are ...

DilateVertices[v, d] multiplies each coordinate of each vertex position in list v by d, thus dilating the embedding. DilateVertices[g, d] dilates the embedding of graph g by ...

Edges[g] gives the list of edges in g. Edges[g, All] gives the edges of g along with the graphics options associated with each edge. Edges[g, EdgeWeight] returns the list of ...

GraphOptions[g] returns the display options associated with g. GraphOptions[g, v] returns the display options associated with vertex v in g. GraphOptions[g, {u, v}] returns ...

IncidenceMatrix[g] returns the (0, 1)-matrix of graph g, which has a row for each vertex and a column for each edge and (v, e) = 1 if and only if vertex v is incident upon ...

NthPair[n] returns the n\[Null]^th unordered pair of distinct positive integers, when sequenced to minimize the size of the larger integer. Pairs that have the same larger ...

ShowGraphArray[{g_1, g_2, ...}] displays a row of graphs. ShowGraphArray[{{g_1, ...}, {g_2, ...}, \ ...}] displays a two-dimensional table of graphs.

ShowLabeledGraph[g] displays graph g according to its embedding, with each vertex labeled with its vertex number.ShowLabeledGraph[g, l] uses the i\[Null]^th element of list l ...

SymmetricQ[r] tests if a given square matrix r represents a symmetric relation. SymmetricQ[g] tests if the edges of a given graph represent a symmetric relation.

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.