Search Results for ""

The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...

The graph distance matrix, sometimes also called the all-pairs shortest path matrix, is the square matrix (d_(ij)) consisting of all graph distances from vertex v_i to vertex ...

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 scalar form of Laplace's equation is the partial differential equation del ^2psi=0, (1) where del ^2 is the Laplacian. Note that the operator del ^2 is commonly written ...

Three circles packed inside a triangle such that each is tangent to the other two and to two sides of the triangle are known as Malfatti circles. The Malfatti configuration ...

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

A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form ...

A (p,q)-torus knot is obtained by looping a string through the hole of a torus p times with q revolutions before joining its ends, where p and q are relatively prime. A ...

The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...