Search Results for ""

The Cameron graph is a strongly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(231,30,9,3). It is distance-regular with intersection array ...

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

An algebraic surface of surface order 4. Unlike cubic surfaces, quartic surfaces have not been fully classified. Examples of quartic surfaces include the apple surface, ...

A circumellipse is a circumconic of a triangle that is an ellipse. There is an amazing formula for the area of a circumellipse. Let d_A be the length of the chord of the ...

Take any triangle with polygon vertices A, B, and C. Pick a point A_1 on the side opposite A, and draw a line parallel to BC. Upon reaching the side AC at B_1, draw the line ...

An inellipse inconic that is an ellipse. The locus of the centers of the ellipses inscribed in a triangle is the interior of the medial triangle. Newton gave the solution to ...

A projection of a figure by parallel rays. In such a projection, tangencies are preserved. Parallel lines project to parallel lines. The ratio of lengths of parallel segments ...

A circumconic is a conic section that passes through the vertices of a triangle (Kimberling 1998, p. 235). Every circumconic has a trilinear equation of the form ...

A parallelian is a line drawn parallel to one side of a triangle. The three lines drawn through a given point are known as the triangle's parallelians. There exists a unique ...

The lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...