Search Results for ""

The Petersen graph is the cubic graph on 10 vertices and 15 edges which is the unique (3,5)-cage graph (Harary 1994, p. 175), as well as the unique (3,5)-Moore graph. It can ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

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 ...

Calculating the 13th root of a large number (that is a perfect 13th power) is a famous mental calculation challenge. However, because of difficulties in standardizing the ...

Specifying two adjacent side lengths a and c of a triangle (with a<c) and one acute angle A opposite a does not, in general, uniquely determine a triangle. If sinA<a/c, there ...

An Abelian semigroup is a set whose elements are related by a binary operation (such as addition, rotation, etc.) that is closed, associative, and commutative. A mathematical ...

A plane tiling is said to be isohedral if the symmetry group of the tiling acts transitively on the tiles, and n-isohedral if the tiles fall into n orbits under the action of ...

E. Pegg Jr. (pers. comm., Nov. 8, 2004) found an approximation to Apéry's constant zeta(3) given by zeta(3) approx 10+zeta(16)-sqrt(96), (1) which is good to 6 digits. M. ...

The continued fraction for Apéry's constant zeta(3) is [1; 4, 1, 18, 1, 1, 1, 4, 1, ...] (OEIS A013631). The positions at which the numbers 1, 2, ... occur in the continued ...