Search Results for ""

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 minimum vertex degree, sometimes simply called the minimum degree, of a graph G is the smallest vertex degree of G, denoted delta.

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 symbol "-" which is used to denote a negative number or subtraction.

The Miquel configuration is the 6_4 configuration illustrated above. Its Levi graph is the rhombic dodecahedral graph.

A fractal based on iterating the map F(x)=ax+(2(1-a)x^2)/(1+x^2) (1) according to x_(n+1) = by_n+F(x_n) (2) x_(y+1) = -x_n+F(x_(n+1)). (3) The plots above show 10^4 ...

A version of nim-like games in which the player taking the last piece is the loser. For most impartial games, this form is much harder to analyze, but it requires only a ...

The statistical index P_M=(sump_nq_a)/(sump_0q_a), where p_n is the price per unit in period n and q_n is the quantity produced in period n.

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