DihedralGroupIndex[n, x] returns the cycle index of the dihedral group on n symbols, expressed as a polynomial in x[1], x[2], ..., x[n].

DihedralGroup[n] returns the dihedral group on n symbols. Note that the order of this group is 2 n.

Dihedral is an argument to the Polya-theoretic functions ListNecklaces, NumberOfNecklaces, and NecklacePolynomial, which count or enumerate distinct necklaces. Dihedral ...

Dijkstra[g, v] gives a shortest-path spanning tree and associated distances from vertex v of graph g. The shortest-path spanning tree is given by a list in which element i is ...

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

Directed is an option value for Type.

Distances[g, v] returns the distances in nondecreasing order from vertex v to all vertices in g, treating g as an unweighted graph.

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

Distribution[l, set] lists the frequency of each element of set in list l.

DodecahedralGraph returns the graph corresponding to the dodecahedron, a Platonic solid.