Search Results for ""

A set of maximum degree to which all other degrees of recursively enumerable sets can be many-one reduced. If set A is many-one complete, then it is one-one complete, and ...

A maximal independent set is an independent set which is a maximal set, i.e., an independent set that is not a subset of any other independent set. The generic term "maximal ...

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...

The mean clustering coefficient of a graph G is the average of the local clustering coefficients of G. It is implemented in the Wolfram Language as ...

2^(20)=1024^2=1048576 bytes. Although the term megabyte is almost universally used to refer to 1024^2 bytes, such usage is deprecated in favor of the standard SI naming ...

One million (10^6) bytes. Unfortunately, the term is sometimes also used to mean 2^(20)=1024^2=1048576 bytes. Furthermore, a third meaning of the term refers to 1024000 bytes ...

The polynomials M_k(x;delta,eta) which form the Sheffer sequence for g(t) = {[1+deltaf(t)]^2+[f(t)]^2}^(eta/2) (1) f(t) = tan(t/(1+deltat)) (2) which have generating function ...

When a closed interval [a,b] is partitioned by points a<x_1<x_2<...<x_(n-1)<b, the lengths of the resulting intervals between the points are denoted Deltax_1, Deltax_2, ..., ...

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

The n-roll mill curve is given by the equation x^n-(n; 2)x^(n-2)y^2+(n; 4)x^(n-4)y^4-...=a^n, where (n; k) is a binomial coefficient.