Search Results for ""

An ordered pair (a,b) of nonnegative integers such that there is some set of a points and b edges whose removal disconnects the graph and there is no set of a-1 nodes and b ...

A theorem in set theory stating that, for all sets A and B, the following equivalences hold, A subset B<=>A intersection B=A<=>A union B=B.

The cotree T^* of a spanning tree T in a connected graph G is the spacing subgraph of G containing exactly those edges of G which are not in T (Harary 1994, p. 39).

A countable set is a set that is either finite or denumerable. However, some authors (e.g., Ciesielski 1997, p. 64) use the definition "equipollent to the finite ordinals," ...

The cubic groups are the point groups T_h and O_h together with their pure rotation subgroups T_d, T, and O (Cotton 1990, pp. 433-434).

A linear code C is cyclic if for every codeword (c_0,c_1,...,c_(n-1)) in C, the codeword (c_(n-1),c_0,c_1,...,c_(n-2)) is also in C.

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

The order-n dipole graph D_n is a multigraph consisting of two vertices and n multiple edges joining them. The dipole graph D_2 is a multigraph that can be considered to ...

A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...

A term in social choice theory meaning each alternative receives equal weight for a single vote.