Search Results for ""

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

The join G=G_1+G_2 of graphs G_1 and G_2 with disjoint point sets V_1 and V_2 and edge sets X_1 and X_2 is the graph union G_1 union G_2 together with all the edges joining ...

The term "(a,b)-leaper" (sometimes explicitly called a "single-pattern leaper") describes a fairy chess piece such as a knight that may make moves which simultaneously change ...

A subset {v_1,...,v_k} of a vector space V, with the inner product <,>, is called orthonormal if <v_i,v_j>=0 when i!=j. That is, the vectors are mutually perpendicular. ...

One of the four divisions of observations which have been grouped into four equal-sized sets based on their statistical rank. The quartile including the top statistically ...

The number of ways of folding a strip of stamps has several possible variants. Considering only positions of the hinges for unlabeled stamps without regard to orientation of ...

alpha=1/Nsum_(i=1)^N|x_i-mu|=<|x_i-mu|>.

If f is continuous on a closed interval [a,b], then there is at least one number x^* in [a,b] such that int_a^bf(x)dx=f(x^*)(b-a). The average value of the function (f^_) on ...

An "area" which can be defined for every set--even those without a true geometric area--which is rigid and finitely additive.