DeleteVertex[g, v] deletes a single vertex v from graph g. Here v is a vertex number.

DeleteVertices[g, vList] deletes vertices in vList from graph g. vList has the form {i, j, ...}, where i, j, ... are vertex numbers.

DerangementQ[p] tests whether permutation p is a derangement, that is, a permutation without a fixed point.

DistinctPermutations[l] gives all permutations of the multiset described by list l.

EmptyQ[g] yields True if graph g contains no edges.

EquivalenceClasses[r] identifies the equivalence classes among the elements of matrix r.

EulerianCycle[g] finds an Eulerian cycle of g if one exists.

Eulerian[n, k] gives the number of permutations of length n with k runs.

ExactRandomGraph[n, e] constructs a random labeled graph of exactly e edges and n vertices.

ExtractCycles[g] gives a maximal list of edge-disjoint cycles in graph g.