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.

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

If L^~ is a linear operator on a function space, then f is an eigenfunction for L^~ and lambda is the associated eigenvalue whenever L^~f=lambdaf. Renteln and Dundes (2005) ...

A roll of eight on a pair of six-sided dice in the game of craps. The probability of rolling "eighter from Decatur" is 5/36, or 13.888...%.

If x is a member of a set A, then x is said to be an element of A, written x in A. If x is not an element of A, this is written x not in A. The term element also refers to a ...

A proof which can be accomplished using only real numbers (i.e., real analysis instead of complex analysis; Hoffman 1998, pp. 92-93).

A portion of the Mandelbrot set centered around 0.3+0i with size approximately 0.1+0.1i.

Ellipsoidal calculus is a method for solving problems in control and estimation theory having unknown but bounded errors in terms of sets of approximating ellipsoidal-value ...

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...