Search Results for ""

A maximal independent set is an independent set which is a maximal set, i.e., an independent set that is not a subset of any other independent set. The generic term "maximal ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...

For every infinite loop space machine E, there is a natural equivalence of spectra between EX and Segal's spectrum BX.

Simple majority vote is the only procedure which is anonymous, dual, and monotonic.

Let a function h:U->R be continuous on an open set U subset= C. Then h is said to have the epsilon_(z_0)-property if, for each z_0 in U, there exists an epsilon_(z_0)>0 such ...

A Boolean sigma-algebra which possesses a measure.

In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...

A line of constant longitude on a spheroid (or sphere). More generally, a meridian of a surface of revolution is the intersection of the surface with a plane containing the ...

A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number. Note that while a ...