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.

A point x_0 at which the derivative of a function f(x) vanishes, f^'(x_0)=0. A stationary point may be a minimum, maximum, or inflection point.

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

The center of an inner Soddy circle. It has equivalent triangle center functions alpha = 1+(2Delta)/(a(b+c-a)) (1) alpha = sec(1/2A)cos(1/2B)cos(1/2C)+1, (2) where Delta is ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

The third power point is the triangle center with triangle center function alpha_(32)=a^3. It is Kimberling center X_(32).

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 distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

The Lebesgue covering dimension is an important dimension and one of the first dimensions investigated. It is defined in terms of covering sets, and is therefore also called ...

The point F at which the incircle and nine-point circle are tangent. It has triangle center function alpha=1-cos(B-C) (1) and is Kimberling center X_(11). If F is the ...