Search Results for ""

Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...

An independent dominating set of a graph G is a set of vertices in G that is both an independent vertex set and a dominating set of G. The minimum size of an independent ...

A tree with a finite number of branches at each fork and with a finite number of leaves at the end of each branch is called a finitely branching tree. König's lemma states ...

A generalization of the Kronecker decomposition theorem which states that every finitely generated Abelian group is isomorphic to the group direct sum of a finite number of ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

Let the least term h of a sequence be a term which is smaller than all but a finite number of the terms which are equal to h. Then h is called the lower limit of the ...

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

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 ...

In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), NaN (or "not a number") is a symbolic floating-point representation which is neither a signed infinity nor ...

Let K be a number field of extension degree d over Q. Then an order O of K is a subring of the ring of integers of K with d generators over Z, including 1. The ring of ...