Search Results for ""

The eccentricity epsilon(v) of a graph vertex v in a connected graph G is the maximum graph distance between v and any other vertex u of G. For a disconnected graph, all ...

Let S be a set and F={S_1,...,S_p} a nonempty family of distinct nonempty subsets of S whose union is union _(i=1)^pS_i=S. The intersection graph of F is denoted Omega(F) and ...

The great stellated truncated dodecahedron, also called the quasitruncated great stellated dodecahedron is the uniform polyhedron with Maeder index 66 (Maeder 1997), ...

An equation derived by Kronecker: where r(n) is the sum of squares function, zeta(z) is the Riemann zeta function, eta(z) is the Dirichlet eta function, Gamma(z) is the gamma ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

A group action G×Omega->Omega might preserve a special kind of partition of Omega called a system of blocks. A block is a subset Delta of Omega such that for any group ...

A cycle of a finite group G is a minimal set of elements {A^0,A^1,...,A^n} such that A^0=A^n=I, where I is the identity element. A diagram of a group showing every cycle in ...

A connected labeled graph with n graph edges in which all graph vertices can be labeled with distinct integers (mod n) so that the sums of the pairs of numbers at the ends of ...

There are two important theorems known as Herbrand's theorem. The first arises in ring theory. Let an ideal class be in A if it contains an ideal whose lth power is ...

The Hermite constant is defined for dimension n as the value gamma_n=(sup_(f)min_(x_i)f(x_1,x_2,...,x_n))/([discriminant(f)]^(1/n)) (1) (Le Lionnais 1983). In other words, ...