Search Results for ""

The Janko-Kharaghani-Tonchev graph is a strongly regular graph on 324 vertices and 24786 edges. It has regular parameters (nu,k,lambda,mu)=(324,153,72,72). It is implemented ...

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...

A regular polygon is an n-sided polygon in which the sides are all the same length and are symmetrically placed about a common center (i.e., the polygon is both equiangular ...

The regular nonagon is the regular polygon with nine sides and Schläfli symbol {9}. The regular nonagon cannot be constructed using the classical Greek rules of geometric ...

The Kneser graphs are a class of graph introduced by Lovász (1978) to prove Kneser's conjecture. Given two positive integers n and k, the Kneser graph K(n,k), often denoted ...

A parameterization of a surface x(u,v) in u and v is regular if the tangent vectors (partialx)/(partialu) and (partialx)/(partialv) are always linearly independent.

A topological space X such that for every closed subset C of X and every point x in X\C, there is a continuous function f:X->[0,1] such that f(x)=0 and f(C)={1}. This is the ...

The Sims graph is a distance-transitive graph on 352 vertices (Brouwer et al. 1989, p. 370).

The regular octagon is the regular polygon with eight sides, as illustrated above. The inradius r, circumradius R, and area A of the regular octagon can be computed directly ...

The regular decagon is constructible 10-sided regular polygon with Schläfli symbol {10}. The inradius r, circumradius R, and area can be computed directly from the formulas ...