Search Results for ""

There are a number of interesting results related to the tiling of squares. For example, M. Laczkovich has shown that there are exactly three shapes of non-right triangles ...

The stacked book graph of order (m,n) is defined as the graph Cartesian product S_(m+1) square P_n, where S_m is a star graph and P_n is the path graph on n nodes. It is ...

The (not necessarily regular) tetrahedron of least volume circumscribed around a convex body B with volume V is not known. If B is a parallelepiped, then the smallest-volume ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

A prism graph, denoted Y_n, D_n (Gallian 1987), or Pi_n (Hladnik et al. 2002), and sometimes also called a circular ladder graph and denoted CL_n (Gross and Yellen 1999, p. ...

A bicubic spline is a special case of bicubic interpolation which uses an interpolation function of the form y(x_1,x_2) = sum_(i=1)^(4)sum_(j=1)^(4)c_(ij)t^(i-1)u^(j-1) (1) ...

A unimodal sequence is a finite sequence that first increases and then decreases. A sequence {s_1,s_2,...,s_n} is unimodal if there exists a t such that s_1<=s_2<=...<=s_t ...

Theory of Computation

A sequence of n-tuples that fills n-space more uniformly than uncorrelated random points, sometimes also called a low-discrepancy sequence. Although the ordinary uniform ...