Search Results for ""

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...

The Hadwiger number of a graph G, variously denoted eta(G) (Zelinka 1976, Ivančo 1988) or h(G) (Stiebitz 1990), is the number of vertices in the largest complete minor of G ...

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...

A lossless data compression algorithm which uses a small number of bits to encode common characters. Huffman coding approximates the probability for each character as a power ...

An International Standard Book Number (ISBN) is a code used to uniquely identify a book together. It also uniquely encodes the book's publisher and includes information about ...

The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...

Jacobi's imaginary transformations relate elliptic functions to other elliptic functions of the same type but having different arguments. In the case of the Jacobi elliptic ...

Kurtosis is defined as a normalized form of the fourth central moment mu_4 of a distribution. There are several flavors of kurtosis, the most commonly encountered variety of ...

The Lagrange interpolating polynomial is the polynomial P(x) of degree <=(n-1) that passes through the n points (x_1,y_1=f(x_1)), (x_2,y_2=f(x_2)), ..., (x_n,y_n=f(x_n)), and ...

A Lambert series is a series of the form F(x)=sum_(n=1)^inftya_n(x^n)/(1-x^n) (1) for |x|<1. Then F(x) = sum_(n=1)^(infty)a_nsum_(m=1)^(infty)x^(mn) (2) = ...