CompleteKaryTree[n, k] returns a complete k-ary tree on n vertices.

CompleteQ[g] yields True if graph g is complete. This means that between any pair of vertices there is an undirected edge or two directed edges going in opposite directions.

ConstructTableau[p] performs the bumping algorithm repeatedly on each element of permutation p, resulting in a distinct Young tableau.

Contract[g, {x, y}] gives the graph resulting from contracting the pair of vertices {x, y} of graph g.

CostOfPath[g, p] sums up the weights of the edges in graph g defined by the path p.

CoxeterGraph gives a non-Hamiltonian graph with a high degree of symmetry such that there is a graph automorphism taking any path of length 3 to any other.

CycleStructure[p, x] returns the monomial in x[1], x[2], ..., x[Length[p]] that is the cycle structure of the permutation p.

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

CyclicGroup[n] returns the cyclic group of permutations on n symbols.

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