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

Degrees[g] returns the degrees of vertex 1, 2, 3, ... in that order.

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

DepthFirstTraversal[g, v] performs a depth-first traversal of graph g starting from vertex v, and gives a list of vertices in the order in which they were encountered. ...

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

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

DominatingIntegerPartitionQ[a, b] yields True if integer partition a dominates integer partition b, that is, the sum of a size-t prefix of a is no smaller than the sum of a ...

EdgeChromaticNumber[g] gives the fewest number of colors necessary to color each edge of graph g, so that no two edges incident on the same vertex have the same color.

EdgeColor is an option that allows the user to associate colors with edges. Black is the default color. EdgeColor can be set as part of the graph data structure or in ...