Search Results for ""

The truncated icosahedral graph is the cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated icosahedron. It is sometimes known as the ...

Let L denote the n×n triangular lattice with wraparound. Call an orientation of L an assignment of a direction to each edge of L, and denote the number of orientations of L ...

The universal product code (UPC) is a 12-digit number and associated machine-readable bar code used to identify products being purchased in grocery stores. UPCs encode an ...

A unimodular matrix is a real square matrix A with determinant det(A)=+/-1 (Born and Wolf 1980, p. 55; Goldstein 1980, p. 149). More generally, a matrix A with elements in ...

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

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

n weighings are sufficient to find a bad coin among (3^n-1)/2 coins (Steinhaus 1999, p. 61). vos Savant (1993) gives an algorithm for finding a bad ball among 12 balls in ...

The Weyl tensor is the tensor C_(abcd) defined by R_(abcd)=C_(abcd)+2/(n-2)(g_(a[c)R_d]b-g_(b[c)R_(d]a)) -2/((n-1)(n-2))Rg_(a[c)g_(d]b), (1) where R_(abcd) is the Riemann ...