Search Results for ""

The spherical harmonics can be generalized to vector spherical harmonics by looking for a scalar function psi and a constant vector c such that M = del x(cpsi) (1) = psi(del ...

A schematic diagram used in logic theory to depict collections of sets and represent their relationships. The Venn diagrams on two and three sets are illustrated above. The ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. The most common type of vertex ...

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...

Two lattice points (x,y) and (x^',y^') are mutually visible if the line segment joining them contains no further lattice points. This corresponds to the requirement that ...

The Wagner graph is a name sometimes given to the 4-Möbius ladder (Bondy and Murty 2008, pp. 275-276). The association arises through the theorem of Wagner (1937) that graphs ...

A Wagstaff prime is a prime number of the form (2^p+1)/3 for p a prime number. The first few are given by p=3, 5, 7, 11, 13, 17, 19, 23, 31, 43, 61, 79, 101, 127, 167, 191, ...

The wallpaper groups are the 17 possible plane symmetry groups. They are commonly represented using Hermann-Mauguin-like symbols or in orbifold notation (Zwillinger 1995, p. ...

The Walsh functions consist of trains of square pulses (with the allowed states being -1 and 1) such that transitions may only occur at fixed intervals of a unit time step, ...