Search Results for ""

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

"The" butterfly graph is a name sometimes given to the 5-vertex graph illustrated above. This graph is also known as the "bowtie graph" (West 2000, p. 12) and is the ...

A hexahedral graph is a polyhedral graph on six vertices. There are seven distinct hexahedral graphs (illustrated above) which, through duality, correspond to seven convex ...

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 ...