Search Results for ""

The cubefree part is that part of a positive integer left after all cubic factors are divided out. For example, the cubefree part of 24=2^3·3 is 3. For n=1, 2, ..., the first ...

The n-cycle complement graph C^__n is the graph complement of the cycle graph C_n. Cycle complement graphs are special cases of circulant graphs. The first few are ...

The Davenport constant of a finite Abelian group G is defined to be the length of the longest minimal zero-system of G and is denoted D(G). Symbolically, ...

A set partition of the rational numbers into two nonempty subsets S_1 and S_2 such that all members of S_1 are less than those of S_2 and such that S_1 has no greatest ...

The Dedekind psi-function is defined by the divisor product psi(n)=nproduct_(p|n)(1+1/p), (1) where the product is over the distinct prime factors of n, with the special case ...

Numbers which are not perfect and for which s(N)=sigma(N)-N<N, or equivalently sigma(n)<2n, where sigma(N) is the divisor function. Deficient numbers are sometimes called ...

A (Delta,D)-graph is a graph with maximum vertex degree Delta and diameter at most D. The order of a graph with degree Delta of diameter D is bounded by ...

In continuum theory, a dendrite is a locally connected continuum that contains no simple closed curve. A semicircle is therefore a dendrite, while a triangle is not. The term ...

A Turing machine is called deterministic if there is always at most one instruction associated with a given present internal state/tape state pair (q,s). Otherwise, it is ...

A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...