Search Results for ""

A node which is one graph edge further away from a given node in a rooted tree.

An alternative term for a binomial coefficient, in which (n; k) is read as "n choose k." R. K. Guy suggested this pronunciation around 1950, when the notations ^nC_r and ...

A Chu space is a binary relation from a set A to an antiset X which is defined as a set which transforms via converse functions.

Let a graph G have graph vertices with vertex degrees d_1<=...<=d_m. If for every i<n/2 we have either d_i>=i+1 or d_(n-i)>=n-i, then the graph is Hamiltonian.

A partially ordered set P is a circle order if it is isomorphic to a set of disks ordered by containment.

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.

A set of class representatives is a subset of X which contains exactly one element from each equivalence class.

The classification of a collection of objects generally means that a list has been constructed with exactly one member from each isomorphism type among the objects, and that ...

A clause is a disjunction of literals.

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...