Search Results for ""

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

Four circles may be drawn through an arbitrary point P on a torus. The first two circles are obvious: one is in the plane of the torus and the second perpendicular to it. The ...

The volume of a solid body is the amount of "space" it occupies. Volume has units of length cubed (i.e., cm^3, m^3, in^3, etc.) For example, the volume of a box (cuboid) of ...

The Whittaker functions arise as solutions to the Whittaker differential equation. The linearly independent solutions to this equation are M_(k,m)(z) = ...

A Woodall prime is a Woodall number W_n=2^nn-1 that is prime. The first few Woodall primes are 7, 23, 383, 32212254719, 2833419889721787128217599, ... (OEIS A050918), ...

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p). An s-cluster is an isolated group of s adjacent (i.e., horizontally ...

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

Given a circle expressed in trilinear coordinates by a central circle is a circle such that l:m:n is a triangle center and k is a homogeneous function that is symmetric in ...

Let p be a prime with n digits and let A be a constant. Call p an "A-prime" if the concatenation of the first n digits of A (ignoring the decimal point if one is present) ...