Search Results for ""

The regular tessellation {6,3} consisting of regular hexagons (i.e., a hexagonal grid). In general, the term honeycomb is used to refer to a tessellation in n dimensions for ...

If f(z) is regular and of the form O(e^(k|z|)) where k<pi, for R[z]>=0, and if f(z)=0 for z=0, 1, ..., then f(z) is identically zero.

The Platonic solids, also called the regular solids or regular polyhedra, are convex polyhedra with equivalent faces composed of congruent convex regular polygons. There are ...

The Moscow-Soicher graph is a weakly regular graph on 672 vertices with parameters (nu,k,lambda,mu)=(672,110,28,(0,18)). It is distance-regular but not distance-transitive ...

The apeirogon is an extension of the definition of regular polygon to a figure with an infinite number of sides. Its Schläfli symbol is {infty}. The apeirogon can produce a ...

A dihedron is a regular tiling or map on a sphere composed of two regular p-gons, each occupying a hemisphere and with edge lengths of 2pi/p on a unit sphere. Its Schläfli ...

The Mathon graphs are three strongly regular graphs on 784 vertices with regular parameters as summarized in the following tables. k spectrum regular parameters 0 ...

The (m,q)-Ustimenko graph is the distance-1 or distance-2 graph of the dual polar graph on [C_m(q)] (Brouwer et al. 1989, p. 279). The Ustimenko graph with parameters m and q ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

Given a distance-regular graph G with integers b_i,c_i,i=0,...,d such that for any two vertices x,y in G at distance i=d(x,y), there are exactly c_i neighbors of y in ...