Search Results for ""

The disdyakis triacontahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The pentakis dodecahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

A number of the form a_0+a_1zeta+...+a_(p-1)zeta^(p-1), where zeta=e^(2pii/p) is a de Moivre number and p is a prime number. Unique factorizations of cyclotomic integers fail ...

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...

When ac is divisible by a number b that is relatively prime to a, then c must be divisible by b.

If a prime number divides a norm but not the bases of the norm, it is itself a norm.

An integer n which is tested to see if it divides a given number.

The polyhedral formula generalized to a surface of genus g, V-E+F=chi(g) where V is the number of polyhedron vertices, E is the number of polyhedron edges, F is the number of ...

In random number computation, a seed is an initial number used as the starting point in a random number generating algorithm. In a dynamical system, a seed is a starting ...

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...