Search Results for ""

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60). It is distance-regular as well as distance-transitive ...

A dodecagon is a 12-sided polygon. Several special types of dodecagons are illustrated above. In particular, a dodecagon with vertices equally spaced around a circle and with ...

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...

The Shi-Krotov-Solé graph is a weakly regular graph on 1024 vertices with regular parameters (nu,k,lambda,mu)=(1024,33,2,(0,2)). It is distance-regular but not ...

The Ionin-Kharaghani graph is a strongly regular graph on 765 vertices and 73440 edges. It has regular parameters (nu,k,lambda,mu)=(765,192,48,48). It is implemented in the ...

A point which lies on at least one ordinary line is called an ordinary point, or sometimes a regular point.

Li and Yorke (1975) proved that any one-dimensional system which exhibits a regular cycle of period three will also display regular cycles of every other length as well as ...

The Janko-Kharaghani graphs are two strongly regular graph on 936 and 1800 vertices. They have regular parameters (nu,k,lambda,mu)=(936,375,150,150) and (1800,1029,588,588), ...

Of all convex n-gons of a given perimeter, the one which maximizes area is the regular n-gon.

An automorphism which interchanges the two vertices of a regular map at each edge without interchanging the vertices.