Search Results for ""

The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...

Define a = d(u,v)d(w,x) (1) b = d(u,w)d(v,x) (2) c = d(u,x)d(v,w), (3) where u, v, w, and x are vertices of a graph and d(i,j) is the graph distance between vertices i and j. ...

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

There are (at least) two mathematical constants associated with Theodorus. The first Theodorus's constant is the elementary algebraic number sqrt(3), i.e., the square root of ...

The Zara graph is the unique graph on 126 vertices satisfying the properties that 1) every maximal clique (of which there are a total of 567) has six vertices, and 2) that if ...

The absolute difference of two numbers n_1 and n_2 is |n_1-n_2|, where the minus sign denotes subtraction and |x| denotes the absolute value.

A mathematical object S is said to be additively closed if a,b in S implies that a+b in S.

If a is an element of a field F over the prime field P, then the set of all rational functions of a with coefficients in P is a field derived from P by adjunction of a.

If a map f:G->G^' from a group G to a group G^' satisfies f(ab)=f(b)f(a) for all a,b in G, then f is said to be an antihomomorphism. Moreover, if G and G^' are isomorphic, ...

An operator * for which a*b=-b*a is said to be anticommutative.