Search Results for ""

The edge set of a graph is simply a set of all edges of the graph. The cardinality of the edge set for a given graph g is known as the edge count of g. The edge set for a ...

Edge splitting is the reverse of edge contraction.

Let a distribution to be approximated be the distribution F_n of standardized sums Y_n=(sum_(i=1)^(n)(X_i-X^_))/(sqrt(sum_(i=1)^(n)sigma_X^2)). (1) In the Charlier series, ...

A nonreflexible regular map of genus 7 with eight graph vertices, 28 graph edges, and eight heptagonal faces.

A group action G×X->X is effective if there are no trivial actions. In particular, this means that there is no element of the group (besides the identity element) which does ...

Efron's dice are set of four nontransitive dice such that the probabilities of A winning against B, B against C, C against D, and D against A are all the same. The images ...

The Egawa graph with parameters (p,s) is a distance-regular but not distance-transitive graph on 16^p4^s nodes. These graphs generalize the Doob graphs and give (s,4)-Hamming ...

In two dimensions, the curve known as an "egg' is an oval with one end more pointed than the other.

Let (X,B,mu) be a measure space and let E be a measurable set with mu(E)<infty. Let {f_n} be a sequence of measurable functions on E such that each f_n is finite almost ...

An Egyptian fraction is a sum of positive (usually) distinct unit fractions. The famous Rhind papyrus, dated to around 1650 BC contains a table of representations of 2/n as ...