Search Results for ""

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...

The uniform polyhedra are polyhedra consisting of regular (possibly polygrammic) faces of equal edge length whose polyhedron vertices are all symmetrically equivalent. The ...

17 is a Fermat prime, which means that the 17-sided regular polygon (the heptadecagon) is constructible using compass and straightedge (as proved by Gauss).

The three circular triangles A^'B^'C^', AB^'C^', A^'BC^', and A^'B^'C obtained by extending the arcs of a circular triangle ABC into complete circles.

Axiomatic set theory is a version of set theory in which axioms are taken as uninterpreted rather than as formalizations of pre-existing truths.

A logical system which possesses an explicitly stated set of axioms from which theorems can be derived.

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

If the total group of the canonical series is divided into two parts, the difference between the number of points in each part and the double of the dimension of the complete ...

The chromatic number of a graph is at most the maximum vertex degree Delta, unless the graph is complete or an odd cycle, in which case Delta+1 colors are required.