Search Results for ""

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.

Let each of f(a,b,c) and g(a,b,c) be a triangle center function or the zero function, and let one of the following three conditions hold. 1. The degree of homogeneity of g ...

The nth central trinomial coefficient is defined as the coefficient of x^n in the expansion of (1+x+x^2)^n. It is therefore the middle column of the trinomial triangle, i.e., ...

The centralizer of an element z of a group G is the set of elements of G which commute with z, C_G(z)={x in G,xz=zx}. Likewise, the centralizer of a subgroup H of a group G ...

C=tauT+kappaB, where tau is the torsion, kappa is the curvature, T is the tangent vector, and B is the binormal vector.

The hexagon obtained from an arbitrary hexagon by connecting the centroids of each consecutive three sides. This hexagon has equal and parallel sides (Wells 1991). A proof of ...

A point in a weighted tree that has minimum weight for the tree. The set of all centroid points is called a tree centroid (Harary 1994, p. 36). The largest possible values ...

The three planes determined by the edges of a trihedron and the internal bisectors of the respectively opposite faces are coaxal, and the common line of these planes is ...

A square matrix is called centrosymmetric if it is symmetric with respect to the center (Muir 1960, p. 19).

A convex set K is centro-symmetric, sometimes also called centrally symmetric, if it has a center p that bisects every chord of K through p.