Search Results for ""

A polyhedral graph on five nodes. There are two topologically distinct pentahedral graphs which, through duality, correspond to the skeletons of the square pyramid (left ...

The pentakis dodecahedron is the 60-faced dual polyhedron of the truncated icosahedron A_(11) (Holden 1971, p. 55). It is Wenninger dual W_9. It can be constructed by ...

The pentakis icosidodecahedron is the dual of the chamfered dodecahedron. It contains 42 vertices, 120 edges, and 80 faces. The canonical version has two distinct edge ...

The pentanacci numbers are a generalization of the Fibonacci numbers defined by P_0=0, P_1=1, P_2=1, P_3=2, P_4=4, and the recurrence relation ...

The pentatope graph is the skeleton of the pentatope, namely the complete graph K_5. It is sometimes also known as the Kuratowski graph (Nikolić et al. 2000, p. 281). Since ...

A test for the primality of Fermat numbers F_n=2^(2^n)+1, with n>=2 and k>=2. Then the two following conditions are equivalent: 1. F_n is prime and (k/F_n)=-1, where (n/k) is ...

Let C be an error-correcting code consisting of N codewords,in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...

The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...

A group that coincides with its commutator subgroup. If G is a non-Abelian group, its commutator subgroup is a normal subgroup other than the trivial group. It follows that ...

A perfect partition is a partition of a number n whose elements uniquely generate any number 1, 2, ..., n. {1,1,...,1_()_(n)} is always a perfect partition of n, and every ...