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.

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

Given a differential operator D on the space of differential forms, an eigenform is a form alpha such that Dalpha=lambdaalpha (1) for some constant lambda. For example, on ...

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

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.