Search Results for ""

A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...

The Fritsch graph is the 9-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

A number which is simultaneously square and triangular. Let T_n denote the nth triangular number and S_m the mth square number, then a number which is both triangular and ...

The elongated triangular gyrobicupola is a convex equilateral solid that is Johnson solid J_(36). The unit elongated triangular gyrobicupola has volume ...

The elongated triangular orthobicupola is a convex equilateral solid that is Johnson solid J_(35). The unit longated triangular orthobicupola has volume ...

A number which is simultaneously octagonal and triangular. Let O_n denote the nth octagonal number and T_m the mth triangular number, then a number which is both octagonal ...

A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...

The truncated triangular prism is an undecagon obtained by truncation of a triangular prism. It has 18 vertices, 27 edges, and 11 faces. As a canonical polyhedron with unit ...

Clean tile is a game investigated by Buffon (1777) in which players bet on the number of different tiles a thrown coin will partially cover on a floor that is regularly ...

A strictly upper triangular matrix is an upper triangular matrix having 0s along the diagonal as well as the lower portion, i.e., a matrix A=[a_(ij)] such that a_(ij)=0 for ...