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

A decagon is a ten-sided polygon. Several special types of decagons are illustrated above. In particular, a decagon with vertices equally spaced around a circle and with all ...

An injective patch is a patch such that x(u_1,v_1)=x(u_2,v_2) implies that u_1=u_2 and v_1=v_2. An example of a patch which is injective but not regular is the function ...

An octagon is an eight-sided polygon. Several special types of octagons are illustrated above. In particular, an octagon with vertices equally spaced around a circle and with ...

A pentagon is a five-sided polygon. Several special types of pentagons are illustrated above. In particular, a pentagon with vertices equally spaced around a circle and with ...

The number of graph edges meeting at a given node in a graph is called the order of that graph vertex.

The regular tessellation {6,3} consisting of regular hexagons (i.e., a hexagonal grid). In general, the term honeycomb is used to refer to a tessellation in n dimensions for ...

A topology that is "potentially" a metric topology, in the sense that one can define a suitable metric that induces it. The word "potentially" here means that although the ...

A dipyramid, also called a bipyramid, consists of two pyramids symmetrically placed base-to-base. The dipyramids are duals of the regular prisms. Their skeletons are the ...

If f(z) is regular and of the form O(e^(k|z|)) where k<pi, for R[z]>=0, and if f(z)=0 for z=0, 1, ..., then f(z) is identically zero.