Search Results for ""

Catalan's constant is a constant that commonly appears in estimates of combinatorial functions and in certain classes of sums and definite integrals. It is usually denoted K ...

The nth central binomial coefficient is defined as (2n; n) = ((2n)!)/((n!)^2) (1) = (2^n(2n-1)!!)/(n!), (2) where (n; k) is a binomial coefficient, n! is a factorial, and n!! ...

A polynomial given by Phi_n(x)=product_(k=1)^n^'(x-zeta_k), (1) where zeta_k are the roots of unity in C given by zeta_k=e^(2piik/n) (2) and k runs over integers relatively ...

The detour index omega(G) of a graph G is a graph invariant defined as half the sum of all off-diagonal matrix elements of the detour matrix of G. Unless otherwise stated, ...

The Euler numbers, also called the secant numbers or zig numbers, are defined for |x|<pi/2 by sechx-1=-(E_1^*x^2)/(2!)+(E_2^*x^4)/(4!)-(E_3^*x^6)/(6!)+... (1) ...

Simply stated, floating-point arithmetic is arithmetic performed on floating-point representations by any number of automated devices. Traditionally, this definition is ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

An n-mark Golomb ruler is a set of n distinct nonnegative integers (a_1,a_2,...,a_n), called "marks," such that the positive differences |a_i-a_j|, computed over all possible ...

A Gröbner basis G for a system of polynomials A is an equivalence system that possesses useful properties, for example, that another polynomial f is a combination of those in ...

The Harary index of a graph G on n vertices was defined by Plavšić et al. (1993) as H(G)=1/2sum_(i=1)^nsum_(j=1)^n(RD)_(ij), (1) where (RD)_(ij)={D_(ij)^(-1) if i!=j; 0 if ...