Search Results for ""

A symbol of the form {p,q,r,...} used to describe regular polygons, polyhedra, and their higher-dimensional counterparts. The symbol {p} denotes a regular polygon for integer ...

Inversion is the process of transforming points P to a corresponding set of points P^' known as their inverse points. Two points P and P^' are said to be inverses with ...

The dual of Pascal's theorem (Casey 1888, p. 146). It states that, given a hexagon circumscribed on a conic section, the lines joining opposite polygon vertices (polygon ...

Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...

A quadrilateral, sometimes also known as a tetragon or quadrangle (Johnson 1929, p. 61) is a four-sided polygon. If not explicitly stated, all four polygon vertices are ...

The partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...

The skewness of a graph G is the minimum number of edges whose removal results in a planar graph (Harary 1994, p. 124). The skewness is sometimes denoted mu(G) (Cimikowski ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

A cactus graph, sometimes also called a cactus tree, a mixed Husimi tree, or a polygonal cactus with bridges, is a connected graph in which any two graph cycles have no edge ...

A diamond-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...