Search Results for ""

Given an n-dimensional vector x=[x_1; x_2; |; x_n], (1) a general vector norm |x|, sometimes written with a double bar as ||x||, is a nonnegative norm defined such that 1. ...

The versine, also known as the "versed sine," is a little-used trigonometric function defined by versin(z) = 2sin^2(1/2z) (1) = 1-cosz, (2) where sinz is the sine and cosz is ...

The contraction of a pair of vertices v_i and v_j of a graph, also called vertex identification, is the operation that produces a graph in which the two nodes v_1 and v_2 are ...

A convex polyhedron is defined as the set of solutions to a system of linear inequalities mx<=b (i.e., a matrix inequality), where m is a real s×d matrix and b is a real ...

The vertex figure at a vertex V of a polygon is the line segment joining the midpoints of the two adjacent sides meeting at V. For a regular n-gon with side length a, the ...

The vertex set of a graph is simply a set of all vertices of the graph. The cardinality of the vertex set for a given graph g is known as the vertex count of g. The vertex ...

A positive integer n is a veryprime iff all primes p<=sqrt(n) satisfy {|2[n (mod p)]-p|<=1 very strong; |2[n (mod p)]-p|<=sqrt(p) strong; |2[n (mod p)]-p|<=p/2 weak. (1) The ...

The vierergruppe is the Abelian abstract group on four elements that is isomorphic to the finite group C2×C2 and the dihedral group D_2. The multiplication table of one ...

Every sufficiently large odd number is a sum of three primes (Vinogradov 1937). Ramachandra and Sankaranarayanan (1997) have shown that for sufficiently large n, the error ...

Let gamma(G) denote the domination number of a simple graph G. Then Vizing (1963) conjectured that gamma(G)gamma(H)<=gamma(G×H), where G×H is the graph product. While the ...