Search Results for ""

In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...

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

An xyz embedding, also called an "xyz drawing," is a three-dimensional embedding such that every axis-parallel line contains either zero or two vertices. Such an embedding is ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...

The disdyakis dodecahedron is the dual polyhedron of the Archimedean great rhombicuboctahedron A_3 and Wenninger dual W_(15). It is also called the hexakis octahedron ...

Successive points dividing a golden rectangle into squares lie on a logarithmic spiral (Wells 1991, p. 39; Livio 2002, p. 119) which is sometimes known as the golden spiral. ...

The paragyrate diminished rhombicosidodecahedron is a convex equilateral solid that is Johnson solid J_(77). The unit paragyrate diminished rhombicosidodecahedron has volume ...

A regular ring in the sense of commutative algebra is a commutative unit ring such that all its localizations at prime ideals are regular local rings. In contrast, a von ...

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...