Search Results for ""

The Games graph is a strongly regular graph on 729 vertices with parameters (nu,k,lambda,mu)=(729,112,1,20). It is distance-regular but not distance-transitive with ...

Also known as the first fundamental form, ds^2=g_(ab)dx^adx^b. In the principal axis frame for three dimensions, ds^2=g_(11)(dx^1)^2+g_(22)(dx^2)^2+g_(33)(dx^3)^2. At ...

For 2<=n<=32, it is possible to select 2n lattice points with x,y in [1,n] such that no three are in a straight line (where "straight line" means any line in the plane--not ...

Four line geometry is a finite geometry subject to the following three axioms: 1. there exist exactly four lines, 2. any two distinct lines have exactly one point of on both ...

On a computer screen, the pixels indicating a slanted line are selected with Bresenham's algorithm, developed in 1962 while at IBM.

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

The de Longchamps line is central line L_(32) with trilinear equation a^3alpha+b^3beta+c^3gamma=0 (Droussent 1953; Kimberling 1998, p. 150) which is the anticomplement of the ...

Square line picking is the selection of pairs of points (corresponding to endpoints of a line segment) randomly placed inside a square. n random line segments can be picked ...

The van Aubel line is the line in the plane of a reference triangle that connects the orthocenter H and symmedian point K, and symmedian point of the orthic triangle. The ...

Sylvester's line problem, known as the Sylvester-Gallai theorem in proved form, states that it is not possible to arrange a finite number of points so that a line through ...