Search Results for ""

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

A Moiré pattern is an interference pattern produced by overlaying similar but slightly offset templates. A simple example is obtained by taking two identical ruled ...

Let G be a simple graph with nonsingular (0,1) adjacency matrix A. If all the diagonal entries of the matrix inverse A^(-1) are zero and all the off-diagonal entries of ...

A "squashed" spheroid for which the equatorial radius a is greater than the polar radius c, so a>c (called an oblate ellipsoid by Tietze 1965, p. 27). An oblate spheroid is a ...

The geodesic on an oblate spheroid can be computed analytically, although the resulting expression is much more unwieldy than for a simple sphere. A spheroid with equatorial ...

The term "pathological" is used in mathematics to refer to an example specifically cooked up to violate certain almost universally valid properties. Pathological problems ...

In Moralia, the Greek biographer and philosopher Plutarch states "Chrysippus says that the number of compound propositions that can be made from only ten simple propositions ...

A finite simple connected graph G is quadratically embeddable if its quadratic embedding constant QEC(G) is nonpositive, i.e., QEC(G)<=0. A graph being quadratically ...

The limiting rabbit sequence written as a binary fraction 0.1011010110110..._2 (OEIS A005614), where b_2 denotes a binary number (a number in base-2). The decimal value is ...