Search Results for ""

A 32-sided polygon. The regular icosidodecagon is a constructible polygon, and the regular icosidodecahedron of side length 1 has inradius r, circumradius R, and area A r = ...

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

The Ivanov-Ivanov-Faradjev graph is a distance-regular graph on 990 vertices (Brouwer et al. 1989, p. 369). It has intersection array {7,6,4,4,4,1,1,1;1,1,1,2,4,4,6,7} and is ...

"Jabulani polyhedron" is a term introduced here to refer to the polyhedron illustrated above which underlies the shape of the soccer ball used in the 2010 World Cup in South ...

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 n-Pasechnik graph is a strongly regular graph on (4n-1)^2 vertices constructed from a skew Hadamard matrix of order 4n. It has regular parameters . The 1-Pasechnik is ...

A curve alpha on a regular surface M is a principal curve iff the velocity alpha^' always points in a principal direction, i.e., S(alpha^')=kappa_ialpha^', where S is the ...

A polyhedron or plane tessellation is called semiregular if its faces are all regular polygons and its corners are alike (Walsh 1972; Coxeter 1973, pp. 4 and 58; Holden 1991, ...

In general, a tetrahedron is a polyhedron with four sides. If all faces are congruent, the tetrahedron is known as an isosceles tetrahedron. If all faces are congruent to an ...

Also called a T_(3+1/2)-space, a Tychonoff space is a completely regular space (with the additional condition that it be T_1 for those authors who do not assume this in the ...