Search Results for ""

If the Tutte polynomial T(x,y) of a graph G is given by sumt_(rs)x^ry^s, then the matrix (t_(rs)) is called the rank matrix of G. For example, the Tutte matrix of the ...

Let a cotree of a spanning tree T in a connected graph G be denoted T^*. Then the edges of G which are not in T^* are called its twigs (Harary 1994, p. 39).

The algebra structure of linear functionals on polynomials of a single variable (Roman 1984, pp. 2-3).

An operator T which maps some basic polynomial sequence p_n(x) into another basic polynomial sequence q_n(x).

An infinite set, such as the real numbers, which is not countably infinite.

Not decidable as a result of being neither formally provable nor unprovable.

A game in which a certain player can always win when he plays properly. All categorical games are unfair (Steinhaus 1999, p. 16), as is the game of Marienbad.

A union-closed set is a nonempty finite collection of distinct nonempty finite sets which is closed under union.

A uniquely complemented lattice is a complemented lattice (L, ^ , v ,0,1,^') that satisfies ( forall x in L)( forall y in L)[(x ^ y=0) ^ (x v y=1)]=>y=x^'. The class of ...

A point lattice which can be constructed from an arbitrary parallelogram of unit area. For any such planar lattice, the minimum distance c between any two points is a ...