Search Results for ""

The distance d(u,v) between two vertices u and v of a finite graph is the minimum length of the paths connecting them (i.e., the length of a graph geodesic). If no such path ...

The energy of a graph is defined as the sum of the absolute values of its graph eigenvalues (i.e., the sum of its graph spectrum terms). Other varieties of graph energy are ...

The Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

"The" Griffiths point Gr is the fixed point in Griffiths' theorem. Given four points on a circle and a line through the center of the circle, the four corresponding Griffiths ...

Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...

A group homomorphism is a map f:G->H between two groups such that the group operation is preserved:f(g_1g_2)=f(g_1)f(g_2) for all g_1,g_2 in G, where the product on the ...

An H-space, named after Heinz Hopf, and sometimes also called a Hopf space, is a topological space together with a continuous binary operation mu:X×X->X, such that there ...

A two-dimensional generalization of the Haar transform which is used for the compression of astronomical images. The algorithm consists of dividing the 2^N×2^N image into ...

tau is the ratio tau=omega_2/omega_1 of the two half-periods omega_1 and omega_2 of an elliptic function (Whittaker and Watson 1990, pp. 463 and 473) defined such that the ...

When the elongated square pyramid with unit edge lengths (i.e., an equilateral obelisk) is truncated by a plane passing through opposite corners of its square base and the ...