Search Results for ""

The diagonal triangle of a complete quadrangle is the triangle formed by its three diagonal points. If the quadrangle is a cyclic quadrilateral, then the circle is the polar ...

An arc-transitive graph, sometimes also called a flag-transitive graph, is a graph whose graph automorphism group acts transitively on its graph arcs (Godsil and Royle 2001, ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

The Paley graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a square in the finite field GF(q). This graph is ...

The m×n rook graph (confusingly called the m×n grid by Brouwer et al. 1989, p. 440) and also sometimes known as a lattice graph (e.g., Brouwer) is the graph Cartesian product ...

If two pairs of opposite sides of a complete quadrilateral are pairs of perpendicular lines, the quadrilateral is said to be orthocentric. In such a case, the remaining sides ...

A set of four points, one of which is the orthocenter of the other three. In an orthocentric system, each point is the orthocenter of the triangle of the other three, as ...

The figure determined by four lines, no three of which are concurrent, and their six points of intersection (Johnson 1929, pp. 61-62). Note that this figure is different from ...

A cyclic polygon is a polygon with vertices upon which a circle can be circumscribed. Since every triangle has a circumcircle, every triangle is cyclic. It is conjectured ...

The orthopoles of a line l with respect to the four triangles formed by three out of four vertices of any quadrilateral ABCD lie on a straight line L known as the orthopolar ...