Search Results for ""

The Johnson solids are the convex polyhedra having regular faces and equal edge lengths (with the exception of the completely regular Platonic solids, the "semiregular" ...

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

In general, the external similitude center of two circles C_1=C(x_1,r_1) and C_2=C(x_2,r_2) with centers given in Cartesian coordinates is given by ...

The Bessel functions of the first kind J_n(x) are defined as the solutions to the Bessel differential equation x^2(d^2y)/(dx^2)+x(dy)/(dx)+(x^2-n^2)y=0 (1) which are ...

The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

The braced square problem asks, given a hinged square composed of four equal rods (indicated by the red lines above), how many more hinged rods must be added in the same ...

The cocktail party graph of order n, also called the hyperoctahedral graph (Biggs 1993, p. 17), n-octahedron graph O_n (Jungerman and Ringel 1978), matching graph (Arvind et ...

The Danzer graph is the Levi graph of the Danzer configuration (Boben et al. 2015). It has 70 vertices and 140 edges and is quartic, bipartite, self-dual, and unit-distance. ...

The ditrigonal icosidodecahedral graph is the skeleton of the cube 5-compound, ditrigonal dodecadodecahedron, great ditrigonalIcosidodecahedron, and small ditrigonal ...