Search Results for ""

Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the star discrepancy is defined as D_N^*(P)=sup_(J in Upsilon^*)D(J,P), (1) where the local ...

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i ...

A labeling phi of (the vertices) of a graph G with positive integers taken from the set {1,2,...,r} is said to be r-distinguishing if no graph automorphism of G preserves all ...

To divide is to perform the operation of division, i.e., to see how many times a divisor d goes into another number n. n divided by d is written n/d or n÷d. The result need ...

A number of attractive 10-compounds of the regular dodecahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

A number of attractive 11-compounds of the regular dodecahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

A number of attractive 6-compounds of the regular dodecahedron can be constructed. The first (left figures) can be obtained by combining six dodecahedra, each rotated by 1/10 ...

A number of attractive 7-compounds of the regular dodecahedron can be constructed. The compound illustrated above will be implemented in a future version of the Wolfram ...

For a graph G and a subset S of the vertex set V(G), denote by N_G[S] the set of vertices in G which are in S or adjacent to a vertex in S. If N_G[S]=V(G), then S is said to ...

A point traced out twice as a closed curve is traversed. The maximum number of double points for a nondegenerate quartic curve is three. An ordinary double point is also ...