Search Results for ""

Direct sums are defined for a number of different sorts of mathematical objects, including subspaces, matrices, modules, and groups. The matrix direct sum is defined by ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

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

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 Epstein zeta function for a n×n matrix S of a positive definite real quadratic form and rho a complex variable with R[rho]>n/2 (where R[z] denotes the real part) is ...

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

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