The MathResource
total ordering,
n. a relation that orders a set in such a way that every element is related to every other either by the relation or its converse; a relation R such that for all x and y either xRy or yRx. Some usages demand that the order be antisymmetric. For example, less than is a total ordering on the reals, as contrasted with the partial ordering of set inclusion.