Search Results for ""

The hemiobelisk graph is the skeleton of the hemiobelisk. It has 7 vertices, 11 edges, and 6 faces. It is a minimal unit-distance forbidden graph. It is implemented in the ...

The pentakis icosidodecahedral graph, illustrated above, is a graph on 42 vertices that is the skeleton of the pentakis icosidodecahedron.

The Tilley graph is a polyhedral graph that arises in the investigation of Kempe chainsKempe Chain (Tilley 2018). It has 12 vertices, 29 edges, and 19 faces (one of which is ...

The skeleton of a trapezohedron may be termed a trapezohedral graph. n-trapezohedral graphs are illustrated above for n=3 to 10 in circular embeddings with the two interior ...

The truncated pentakis dodecahedral graph, illustrated above in a pair of embeddings, is the skeleton of the truncated pentakis dodecahedron. It has 180 vertices, 270 edges, ...

Tutte's fragment (Taylor 1997) is the 15-node graph illustrated above (Grünbaum 2003, pp. 358-359 and Fig. 17.1.3). If the graph obtained by adding pendant edges to corners ...

Bilinski (1960) noted that by collapsing any one of the five zones of the rhombic icosahedron, a second rhombic dodecahedron distinct from the dual polyhedron of the ...

Cauchy's functional equation is the equation f(x+y)=f(x)+f(y). It was proved by Cauchy in 1821 that the only continuous solutions of this functional equation from R into R ...

An algebraic surface with affine equation P_d(x_1,x_2)+T_d(x_3)=0, (1) where T_d(x) is a Chebyshev polynomial of the first kind and P_d(x_1,x_2) is a polynomial defined by ...

Euler conjectured that there do not exist Euler squares of order n=4k+2 for k=1, 2, .... In fact, MacNeish (1921-1922) published a purported proof of this conjecture (Bruck ...