Search Results for ""

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

The unique 8_3 configuration. It is transitive and self-dual, but cannot be realized in the real projective plane. Its Levi graph is the Möbius-Kantor graph.

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

An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...

The Paley graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a square in the finite field GF(q). This graph is ...

The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...

Erdős and Rényi (1960) showed that for many monotone-increasing properties of random graphs, graphs of a size slightly less than a certain threshold are very unlikely to have ...

Ramsey's theorem is a generalization of Dilworth's lemma which states for each pair of positive integers k and l there exists an integer R(k,l) (known as the Ramsey number) ...

A set S and a binary operator * are said to exhibit closure if applying the binary operator to two elements S returns a value which is itself a member of S. The closure of a ...

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