Search Results for ""

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...

A unit of angular measure in which the angle of an entire circle is 400 gradians. A right angle is therefore 100 gradians. A gradian is sometimes also called a gon or a grade.

Every graph with n vertices and maximum vertex degree Delta(G)<=k is (k+1)-colorable with all color classes of size |_n/(k+1)_| or [n/(k+1)], where |_x_| is the floor ...

The Higman-Sims group is the sporadic group HS of order |HS| = 44352000 (1) = 2^9·3^2·5^3·7·11. (2) The Higman-Sims group is 2-transitive, and has permutation representations ...

Let Gamma be an algebraic curve in a projective space of dimension n, and let p be the prime ideal defining Gamma, and let chi(p,m) be the number of linearly independent ...

On a compact oriented Finsler manifold without boundary, every cohomology class has a unique harmonic representation. The dimension of the space of all harmonic forms of ...

The central point in a wheel graph W_n. The hub has degree n-1.

A polynomial that represents integers for all integer values of the variables. An integer polynomial is a special case of such a polynomial. In general, every integer ...

An algebraically soluble equation of odd prime degree which is irreducible in the natural field possesses either 1. Only a single real root, or 2. All real roots.

A graph for which every node has finite degree.