Search Results for ""

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

If sets E and F are independent, then so are E and F^', where F^' is the complement of F (i.e., the set of all possible outcomes not contained in F). Let union denote "or" ...

Let X be an arbitrary topological space. Denote the set closure of a subset A of X by A^- and the complement of A by A^'. Then at most 14 different sets can be derived from A ...

While the pedal point, Cevian point, and even pedal-Cevian point are commonly used concepts in triangle geometry, there seems to be no established term to describe the ...

The point of concurrence K of the symmedians, sometimes also called the Lemoine point (in England and France) or the Grebe point (in Germany). Equivalently, the symmedian ...

Let T_1 be the point at which the J_1-excircle meets the side A_2A_3 of a triangle DeltaA_1A_2A_3, and define T_2 and T_3 similarly. Then the lines A_1T_1, A_2T_2, and A_3T_3 ...

A point which lies on at least one ordinary line is called an ordinary point, or sometimes a regular point.

A point at the intersection of two or more grid lines in a point lattice.

An accumulation point is a point which is the limit of a sequence, also called a limit point. For some maps, periodic orbits give way to chaotic ones beyond a point known as ...

The point of illumination for a caustic.