Search Results for ""

The self-describing sequence consisting of "blocks" of single and double 1s and 2s, where a "block" is a single digit or pair of digits that is different from the digit (or ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

The plots above show the values of the function obtained by taking the natural logarithm of the gamma function, lnGamma(z). Note that this introduces complicated branch cut ...

A Mersenne number is a number of the form M_n=2^n-1, (1) where n is an integer. The Mersenne numbers consist of all 1s in base-2, and are therefore binary repunits. The first ...

A Möbius ladder, sometimes called a Möbius wheel (Jakobson and Rivin 1999), of order n is a simple graph obtained by introducing a twist in a prism graph of order n that is ...

Numerical integration is the approximate computation of an integral using numerical techniques. The numerical computation of an integral is sometimes called quadrature. ...

There are two kinds of power sums commonly considered. The first is the sum of pth powers of a set of n variables x_k, S_p(x_1,...,x_n)=sum_(k=1)^nx_k^p, (1) and the second ...

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 regular graph that is edge-transitive but not vertex-transitive is called a semisymmetric graph (Marušič and Potočnik 2001). In contrast, any graph that is both ...

There are several differing definitions of the sun graph. ISGCI defines a (complete) n-sun graph as a graph on 2n nodes (sometimes also known as a trampoline graph; ...