Search Results for ""

The Schläfli graph is a strongly regular graph on 27 nodes which is the graph complement of the generalized quadrangle GQ(2,4). It is the unique strongly regular graph with ...

The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...

A vector is formally defined as an element of a vector space. In the commonly encountered vector space R^n (i.e., Euclidean n-space), a vector is given by n coordinates and ...

The constant pi, denoted pi, is a real number defined as the ratio of a circle's circumference C to its diameter d=2r, pi = C/d (1) = C/(2r) (2) pi has decimal expansion ...

Legendre showed that there is no rational algebraic function which always gives primes. In 1752, Goldbach showed that no polynomial with integer coefficients can give a prime ...

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

Catalan's constant is a constant that commonly appears in estimates of combinatorial functions and in certain classes of sums and definite integrals. It is usually denoted K ...

The nth central binomial coefficient is defined as (2n; n) = ((2n)!)/((n!)^2) (1) = (2^n(2n-1)!!)/(n!), (2) where (n; k) is a binomial coefficient, n! is a factorial, and n!! ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

The Gewirtz graph, sometimes also called the Sims-Gewirtz graph (Brouwer), is an integral graph on 56 nodes and 280 edges that is also a regular graph of order 10. It is ...