Search Results for ""

The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...

If f is a schlicht function and D(z_0,r) is the open disk of radius r centered at z_0, then f(D(0,1)) superset= D(0,1/4), where superset= denotes a (not necessarily proper) ...

A lattice automorphism is a lattice endomorphism that is also a lattice isomorphism.

The Lemoine hexagon is a cyclic hexagon with vertices given by the six concyclic intersections of the parallels of a reference triangle through its symmedian point K. The ...

The symbol o(x), pronounced "little-O of x," is one of the Landau symbols and is used to symbolically express the asymptotic behavior of a given function. In particular, if n ...

A theorem that can be stated either in the language of abstract algebraic curves or transcendental extensions. For an abstract algebraic curve, if x and y are nonconstant ...

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

In algebraic geometry classification problems, an algebraic variety (or other appropriate space in other parts of geometry) whose points correspond to the equivalence classes ...

A Münchhausen number (sometimes spelled Münchausen number, with a single 'h') is a number equal to the sum of its digits raised to each digit's power. Münchhausen numbers ...

The ordinary Onsager equation is the sixth-order ordinary differential equation (d^3)/(dx^3)[e^x(d^2)/(dx^2)(e^x(dy)/(dx))]=f(x) (Vicelli 1983; Zwillinger 1997, p. 128), ...