Search Results for ""

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

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

Voronin (1975) proved the remarkable analytical property of the Riemann zeta function zeta(s) that, roughly speaking, any nonvanishing analytic function can be approximated ...

A weak snark is a cyclically 4-edge connected cubic graph with edge chromatic number 4 and girth at least 4 (Brinkmann et al. 2013). Weak snarks therefore represent a more ...

The term "wedge" has a number of different meanings in mathematics. It is sometimes used as another name for the caret symbol. The term also refers to the notation ( ^ ) used ...

The weighted mean of a discrete set of numbers {x_1,x_2,...,x_n} with weights {w_1,w_2,...,w_n} is given by <x>=sum_(i=1)^nw_ix_i, (1) where each weight w_i is a nonnegative ...

The prime link 05-0201, illustrated above, with braid word sigma_1^2sigma_2^2sigma_1^(-1)sigma_2^(-2) or sigma_1sigma_2^(-1)sigma_1sigma_2^(-2) and Jones polynomial ...

Let V be a real symmetric matrix of large order N having random elements v_(ij) that for i<=j are independently distributed with equal densities, equal second moments m^2, ...

WireWorld is a two-dimensional four-color cellular automaton introduced by Brian Silverman in 1987. The rule for the automaton uses the cell's old value a together with the ...

A Woodall prime is a Woodall number W_n=2^nn-1 that is prime. The first few Woodall primes are 7, 23, 383, 32212254719, 2833419889721787128217599, ... (OEIS A050918), ...