Search Results for ""

The dual of a regular tessellation is formed by taking the center of each polygon as a vertex and joining the centers of adjacent polygons. The triangular and hexagonal ...

The dual vector space to a real vector space V is the vector space of linear functions f:V->R, denoted V^*. In the dual of a complex vector space, the linear functions take ...

The class of curve known as Dürer's conchoid appears in Dürer's work Instruction in Measurement with Compasses and Straight Edge (1525) and arose in investigations of ...

A variable that appears in a calculation only as a placeholder and which disappears completely in the final result. For example, in the integral int_0^xf(x^')dx^', x^' is a ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

In a graph G, contraction of an edge e with endpoints u,v is the replacement of u and v with a single vertex such that edges incident to the new vertex are the edges other ...

The edge count of a graph g, commonly denoted M(g) or E(g) and sometimes also called the edge number, is the number of edges in g. In other words, it is the cardinality of ...

An edge cover is a subset of edges defined similarly to the vertex cover (Skiena 1990, p. 219), namely a collection of graph edges such that the union of edge endpoints ...

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...

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