Search Results for ""

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

The roots of a semisimple Lie algebra g are the Lie algebra weights occurring in its adjoint representation. The set of roots form the root system, and are completely ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

The BCI triangle DeltaA^'B^'C^' of a triangle DeltaABC with incenter I is defined by letting A^' be the center of the incircle of DeltaBCI, and similarly defining B^' and ...

Various forms of opening and closing bracket-like delimiters are used for a number of distinct notational purposes in mathematics. The most common variants of bracket ...

One of the polynomials obtained by taking powers of the Brahmagupta matrix. They satisfy the recurrence relation x_(n+1) = xx_n+tyy_n (1) y_(n+1) = xy_n+yx_n. (2) A list of ...

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

Given a triangle DeltaABC and a point P not a vertex of DeltaABC, define the A^'-vertex of the circumcevian triangle as the point other than A in which the line AP meets the ...

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