Search Results for ""

Let M be an oriented regular surface in R^3 with normal N. Then the support function of M is the function h:M->R defined by h(p)=p·N(p).

X fulfils the T1-separation axiom and is regular. A space satisfying the T_3-separation axiom is said to be a T3-space.

The perpendicular distance h from an arc's midpoint to the chord across it, equal to the radius R minus the apothem r, h=R-r. (1) For a regular polygon of side length a, h = ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

Given a pick-7 lottery with 23 numbers that pays a prize to anyone matching at least 4 of the 7 numbers, there is a set of 253 tickets that guarantees a win. This set ...

A hexagonal grid is a grid formed by a tessellation of regular hexagons. Boards made of hexagonal grids are often found in strategy and role-playing games because of the lack ...

Let a graph G have graph vertices with vertex degrees d_1<=...<=d_m. If for every i<n/2 we have either d_i>=i+1 or d_(n-i)>=n-i, then the graph is Hamiltonian.

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...