Search Results for ""

The salinon is the figure illustrated above formed from four connected semicircles. The word salinon is Greek for "salt cellar," which the figure resembles. If the radius of ...

A clique of a graph G is a complete subgraph of G, and the clique of largest possible size is referred to as a maximum clique (which has size known as the (upper) clique ...

An edge automorphism of a graph G is a permutation of the edges of G that sends edges with common endpoint into edges with a common endpoint. The set of all edge ...

There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...

A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...

The "witch of Agnesi" is a curve studied by Maria Agnesi in 1748 in her book Instituzioni analitiche ad uso della gioventù italiana (the first surviving mathematical work ...

Fermat's last theorem is a theorem first proposed by Fermat in the form of a note scribbled in the margin of his copy of the ancient Greek text Arithmetica by Diophantus. The ...

In Book IX of The Elements, Euclid gave a method for constructing perfect numbers (Dickson 2005, p. 3), although this method applies only to even perfect numbers. In a 1638 ...

The Pappus configuration is the 9_3 configuration illustrated above that appears in Pappus's hexagon theorem. It is one of the three 9_3 configurations. The Levi graph of the ...

A canonical labeling, also called a canonical form, of a graph G is a graph G^' which is isomorphic to G and which represents the whole isomorphism class of G (Piperno 2011). ...