Search Results for ""

A generalized Moore graph is a regular graph of degree r where the counts of vertices at each distance d=0, 1, ... from any vertex are 1, r, r(r-1), r(r-1)^2, r(r-1)^3, ..., ...

Let O be an incidence geometry, i.e., a set with a symmetric, reflexive binary relation I. Let e and f be elements of O. Let an incidence plane be an incidence geometry whose ...

The geometric mean of a sequence {a_i}_(i=1)^n is defined by G(a_1,...,a_n)=(product_(i=1)^na_i)^(1/n). (1) Thus, G(a_1,a_2) = sqrt(a_1a_2) (2) G(a_1,a_2,a_3) = ...

The Gergonne line is Oldknow's (1996) term for the perspectrix of a contact triangle DeltaDEF and its reference triangle DeltaABC. It is determined by the Nobbs points D^', ...

The Gergonne point Ge is the perspector of a triangle DeltaABC and its contact triangle DeltaT_AT_BT_C. It has equivalent triangle center functions alpha = [a(b+c-a)]^(-1) ...

The Gershgorin circle theorem (where "Gershgorin" is sometimes also spelled "Gersgorin" or "Gerschgorin") identifies a region in the complex plane that contains all the ...

The Gibert point can be defined as follows. Given a reference triangle DeltaABC, reflect the point X_(1157) (which is the inverse point of the Kosnita point in the ...

The Gini coefficient (or Gini ratio) G is a summary statistic of the Lorenz curve and a measure of inequality in a population. The Gini coefficient is most easily calculated ...

A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...

Let lambda be (possibly complex) eigenvalues of a set of random n×n real matrices with entries independent and taken from a standard normal distribution. Then as n->infty, ...