Search Results for ""

The n-dimensional Keller graph, sometimes denoted G_n (e.g., Debroni et al. 2011), can be defined on a vertex set of 4^n elements (m_1,...,m_n) where each m_i is 0, 1, 2, or ...

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

The Steinmetz solid is the solid common to two (or three) right circular cylinders of equal radii intersecting at right angles is called the Steinmetz solid. Two cylinders ...

The tesseract is the hypercube in R^4, also called the 8-cell or octachoron. It has the Schläfli symbol {4,3,3}, and vertices (+/-1,+/-1,+/-1,+/-1). The figure above shows a ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

An amicable pair (m,n) consists of two integers m,n for which the sum of proper divisors (the divisors excluding the number itself) of one number equals the other. Amicable ...

The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...

Ball point picking is the selection of points randomly placed inside a ball. n random points can be picked in a unit ball in the Wolfram Language using the function ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...