Search Results for ""

As defined by Kyrmse, a canonical polygon is a closed polygon whose vertices lie on a point lattice and whose edges consist of vertical and horizontal steps of unit length or ...

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

The circum-medial triangle DeltaA^'B^'C^' is the circumcevian triangle of a reference triangle DeltaABC with respect to the triangle centroid G of DeltaABC (Kimberling 1998, ...

The circum-orthic triangle DeltaA^'B^'C^' is the circumcevian triangle of a triangle DeltaABC with respect to the orthocenter H (Kimberling 1998, p. 163). The circum-orthic ...

The circumcircle mid-arc triangle is the triangle whose vertices are given by the circumcircle mid-arc points of a given reference triangle. Its trilinear vertex matrix is ...

Clark's triangle is a number triangle created by setting the vertex equal to 0, filling one diagonal with 1s, the other diagonal with multiples of an integer f, and filling ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

The coboundary polynomial chi^__G(q,t) is a bivariate graph polynomial which can be expressed in terms of the Tutte polynomial T_G(x,y) of a graph G by ...

The mapping of a grid of regularly ruled squares onto a cone with no overlap or misalignment. Cone nets are possible for vertex angles of 90 degrees, 180 degrees, and 270 ...

The inner and outer spheres tangent internally to a cone and also to a plane intersecting the cone are called Dandelin spheres. The spheres can be used to show that the ...