Search Results for ""

A topological sort is a permutation p of the vertices of a graph such that an edge {i,j} implies that i appears before j in p (Skiena 1990, p. 208). Only acyclic digraphs can ...

A trail is a walk v_0, e_1, v_1, ..., v_k with no repeated edge. The length of a trail is its number of edges. A u,v-trail is a trail with first vertex u and last vertex v, ...

The triangular cupola is Johnson solid J_3. Its faces consist of 4 equilateral triangles, 3 squares, and 1 hexagon. It is implemented in the Wolfram Language as ...

A triangular pyramid is a pyramid having a triangular base. The tetrahedron is a triangular pyramid having congruent equilateral triangles for each of its faces. The edge ...

The polyhedron compound of the truncated cube and its dual, the small triakis octahedron. The compound can be constructed from a truncated cube of unit edge length by ...

The polyhedron compound of the truncated octahedron and its dual, the tetrakis hexahedron. The compound can be constructed from a truncated octahedron of unit edge length by ...

The compound of a truncated tetrahedron and its dual, the triakis tetrahedron. The compound can be constructed from a truncated octahedron of unit edge length by midpoint ...

A cube whose edge lengths are 1. The unit cube therefore has unit volume.

The vertex count of a graph g, commonly denoted V(g) or |g|, is the number of vertices in g. In other words, it is the cardinality of the vertex set. The vertex count of a ...

A zero-sum game is a game in which players make payments only to each other. In such a game, one player's loss is the other player's gain, so the total amount of "money" ...