Search Results for ""

A magic square for which the number of letters in the word for each number generates another magic square. This definition depends, of course, on the language being used. In ...

A topological space is locally connected at the point x if every neighborhood of x contains a connected open neighborhood. It is called locally connected if it is locally ...

The Kittell graph is a planar graph on 23 nodes and 63 edges that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof of ...

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...

The Johnson triangle DeltaJ_AJ_BJ_C, a term coined here for the first time, is the triangle formed by the centers of the Johnson circles. It has trilinear vertex matrix ...

The Darboux cubic Z(X_(20)) of a triangle DeltaABC is the locus of all pedal-cevian points (i.e., of all points whose pedal triangle is perspective with DeltaABC). It is a ...

Given a line having trilinear coordinate equation lalpha+mbeta+ngamma=0 with respect to a reference triangle DeltaABC, the point mn:nl:lm is called the trilinear pole of the ...

Young's geometry is a finite geometry which satisfies the following five axioms: 1. There exists at least one line. 2. Every line of the geometry has exactly three points on ...

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

The coordinates representing any point of an n-dimensional affine space A by an n-tuple of real numbers, thus establishing a one-to-one correspondence between A and R^n. If V ...