Search Results for ""
31 - 40 of 337 for planarSearch Results
A numerical knot invariant. For a tame knot K, the bridge index is the least bridge number of all planar representations of the knot. The bridge index of the unknot is ...
A prismatoid having planar sides and the same number of vertices in both of its parallel planes. The faces of a prismoid are therefore either trapezoids or parallelograms. ...
A biplanar graph is defined as a graph that is the graph union of two planar edge-induced subgraphs. In other words, biplanar graphs are graphs with graph thickness 1 or 2 ...
The projective plane crossing number of a graph is the minimal number of crossings with which the graph can be drawn on the real projective plane. A graph with projective ...
Let D be a planar Abelian difference set and t be any divisor of n. Then t is a numerical multiplier of D, where a multiplier is defined as an automorphism alpha of a group G ...
A half-plane is a planar region consisting of all points on one side of an infinite straight line, and no points on the other side. If the points on the line are included, ...
A two-dimensional planar closed surface L which has a mass M and a surface density sigma(x,y) (in units of mass per areas squared) such that M=int_Lsigma(x,y)dxdy. The center ...
A planar diagram depicting a link (or knot) as a sequence of segments with gaps representing undercrossings and solid lines overcrossings. In such a diagram, only two ...
A theorem that classifies planar regular closed curves up to regular homotopy by their contour winding numbers (Whitney 1937). In his thesis, S. Smale generalized this result ...
A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...
...
View search results from all Wolfram sites (1152 matches)

