Search Results for ""

The edge multiplicity of a given end vertex in a multigraph is the number of multiple edges sharing that end vertex. The maximum edge multiplicity in such a graph is known as ...

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.

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

If A is an n×n square matrix and lambda is an eigenvalue of A, then the union of the zero vector 0 and the set of all eigenvectors corresponding to eigenvalues lambda is ...

Let ABCD be a quadrilateral with perpendicular polygon diagonals. The midpoints of the sides (a, b, c, and d) determine a parallelogram (the Varignon parallelogram) with ...

If, in the above commutative diagram of modules and module homomorphisms the columns and two upper rows are exact, then so is the bottom row.

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

The Eisenstein units are the Eisenstein integers +/-1, +/-omega, +/-omega^2, where omega = 1/2(-1+isqrt(3)) (1) omega^2 = 1/2(-1-isqrt(3)). (2)