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

Let f be analytic on a domain U subset= C, and assume that f never vanishes. Then if there is a point z_0 in U such that |f(z_0)|<=|f(z)| for all z in U, then f is constant. ...

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.

The sum of sets A and B in a vector space, equal to {a+b:a in A,b in B}.

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

A minor arc (left figure) is an arc of a circle having measure less than or equal to 180 degrees (pi radians).

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.

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