Search Results for ""

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

A minimum dominating set is a dominating set of smallest size in a given graph. The size of a minimum dominating set is known as the domination number of the graph. A minimum ...

The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...

The Minkowski measure of a bounded, closed set is the same as its Lebesgue measure.

Let R be a number ring of degree n with 2s imaginary embeddings. Then every ideal class of R contains an ideal J such that ||J||<=(n!)/(n^n)(4/pi)^ssqrt(|disc(R)|), where ...

The operation of subtraction, i.e., a minus b. The operation is denoted a-b. The minus sign "-" is also used to denote a negative number, i.e., -x.

The symbol "-" which is used to denote a negative number or subtraction.

A mixed fraction is an improper fraction p/q>1 written in the form n+r/s. In common usage such as cooking recipes, n+r/s is often written as n r/s (e.g., 1 1/2), much to the ...

A mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...

A number b_(2n) having generating function sum_(n=0)^(infty)b_(2n)x^(2n) = 1/2ln((e^(x/2)-e^(-x/2))/(1/2x)) (1) = 1/2ln2+1/(48)x^2-1/(5760)x^4+1/(362880)x^6-.... (2) For n=1, ...