Search Results for ""

Iofinova and Ivanov (1985) showed that there exist exactly five bipartite cubic semisymmetric graphs whose automorphism groups preserves the bipartite parts and acts ...

Let x be a real number, and let R be the set of positive real numbers mu for which 0<|x-p/q|<1/(q^mu) (1) has (at most) finitely many solutions p/q for p and q integers. Then ...

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

In its original form, the Poincaré conjecture states that every simply connected closed three-manifold is homeomorphic to the three-sphere (in a topologist's sense) S^3, ...

A polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients. A polynomial in one variable (i.e., a univariate ...

The regular octahedron, often simply called "the" octahedron, is the Platonic solid with six polyhedron vertices, 12 polyhedron edges, and eight equivalent equilateral ...

A Sierpiński number of the second kind is a number k satisfying Sierpiński's composite number theorem, i.e., a Proth number k such that k·2^n+1 is composite for every n>=1. ...

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...

In mathematics, a knot is defined as a closed, non-self-intersecting curve that is embedded in three dimensions and cannot be untangled to produce a simple loop (i.e., the ...

The 120-cell is a finite regular four-dimensional polytope with Schläfli symbol {5,3,3}. It is also known as the hyperdodecahedron or hecatonicosachoron, and is composed of ...