Search Results for ""

A tiling of regular polygons (in two dimensions), polyhedra (three dimensions), or polytopes (n dimensions) is called a tessellation. Tessellations can be specified using a ...

The Doob graph D(m,n) is the graph given by the graph Cartesian product of m>=1 copies of the Shrikhande graph with a Hamming graph H(n,4). Doob graphs are distance-regular ...

The Suzuki graph is an edge-transitive strongly regular graph on 1782 vertices with parameters (nu,k,lambda,mu)=(1782,416,100,96) and automorphism group Suz.2. It is an ...

The Leonard graph is a distance-regular graph on 288 vertices (Brouwer et al. 1989, p. 369) with intersection array {12,11,10,7;1,2,5,12}. It is however not ...

A property that passes from a topological space to every subspace with respect to the relative topology. Examples are first and second countability, metrizability, the ...

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

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

The Brouwer-Haemers graph is the unique strongly regular graph on 81 vertices with parameters nu=81, k=20, lambda=1, mu=6 (Brouwer and Haemers 1992, Brouwer). It is also ...

The circumradius of a cyclic polygon is a radius of the circle inside which the polygon can be inscribed. Similarly, the circumradius of a polyhedron is the radius of a ...

The Conway-Smith graph is a distance-transitive graph on 63 vertices having intersection array {10,6,4,1;1,2,6,10} (Hall 1980). It is also distance-transitive. It is denoted ...