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.

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 ...

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.

Let P=alpha_1:beta_1:gamma_1 and Q=alpha_2:beta_2:gamma_2 be points, neither of which lie on a sideline of the reference triangle DeltaABC. The P-Ceva conjugate X of Q is ...

Suppose P=p:q:r and U=u:v:w are points, neither lying on a sideline of DeltaABC. Then the cevapoint of P and U is the point (pv+qu)(pw+ru):(qw+rv)(qu+pv) :(ru+pw)(rv+qw).

A Cevian point P is point with respect to which a set of Cevians of a triangle are taken. Connecting the endpoints of the Cevians through a point P gives the so-called Cevian ...

Vandeghen's (1965) name for the transformation taking points to their isotomic conjugates.