Search Results for ""

A number of attractive 11-compounds of the regular dodecahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

A number of attractive 7-compounds of the regular dodecahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

The Dürer graph is the skeleton of Dürer's solid, which is the generalized Petersen graph GP(6,2). It is illustrated above in a number of embeddings. It is implemented in the ...

The length of the largest-sized square contained within the Ferrers diagram of a partition. Its size can be determined using DurfeeSquare[f] in the Wolfram Language package ...

The Dutch windmill graph D_3^((m)), also called a friendship graph, is the graph obtained by taking m copies of the cycle graph C_3 with a vertex in common (Gallian 2007), ...

The edge set of a graph is simply a set of all edges of the graph. The cardinality of the edge set for a given graph g is known as the edge count of g. The edge set for a ...

The elongated gyrobifastigium, which could also be called an elongated digonal gyrobicupola, is a family of octahedra obtained by elongating the gyrobifastigium with four ...

Exponentiation is the process of taking a quantity b (the base) to the power of another quantity e (the exponent). This operation most commonly denoted b^e. In TeX, the ...

The extended greatest common divisor of two integers m and n can be defined as the greatest common divisor GCD(m,n) of m and n which also satisfies the constraint ...

An expression occurring in existential sentences. "For some x" is the same as " exists x." Unlike in everyday language, it is does not necessarily refer to a plurality of ...