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 ...

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 ...

GeneralizedPetersenGraph[n, k] returns the generalized Petersen graph, for integers n > 1 and k > 0, which is the graph with vertices {u_1, u_2, ..., u_n} and {v_1, v_2, ..., ...

IsomorphicQ[g, h] yields True if graphs g and h are isomorphic.

Isomorphism[g, h] gives an isomorphism between graphs g and h if one exists. Isomorphism[g, h, All] gives all isomorphisms between graphs g and h. Isomorphism[g] gives the ...

OrbitRepresentatives[pg, x] returns a representative of each orbit of x induced by the action of the group pg on x.

Orbits[pg, x] returns the orbits of x induced by the action of the group pg on x.

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