Search Results for ""

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

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

For operators A^~ and B^~, the anticommutator is defined by {A^~,B^~}=A^~B^~+B^~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.

The antilaplacian of u with respect to x is a function whose Laplacian with respect to x equals u. The antilaplacian is never unique.