ConnectedQ[g] yields True if undirected graph g is connected. If g is directed, the function returns True if the underlying undirected graph is connected. ConnectedQ[g, ...

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.

CubeConnectedCycle[d] returns the graph obtained by replacing each vertex in a d-dimensional hypercube by a cycle of length d. Cube-connected cycles share many properties ...

CubicalGraph returns the graph corresponding to the cube, a Platonic solid.

Cut is a tag that can be used in a call to NetworkFlow to tell it to return the minimum cut.

CycleIndex[pg, x] returns the polynomial in x[1], x[2], ..., x[index[pg]] that is the cycle index of the permutation group pg. Here index[pg] refers to the length of each ...

Cycle[n] constructs the cycle on n vertices, the 2-regular connected graph. An option Type that takes on values Directed or Undirected is allowed. The default setting is Type ...