Search Results for ""

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

A Gaussian integer is a complex number a+bi where a and b are integers. The Gaussian integers are members of the imaginary quadratic field Q(sqrt(-1)) and form a ring often ...

The angular twist theta of a shaft with given cross section is given by theta=(TL)/(KG) (1) (Roark 1954, p. 174), where T is the twisting moment (commonly measured in units ...

A unit circle is a circle of unit radius, i.e., of radius 1. The unit circle plays a significant role in a number of different areas of mathematics. For example, the ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...

RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...

An extension F of a field K is said to be algebraic if every element of F is algebraic over K (i.e., is the root of a nonzero polynomial with coefficients in K).

Taking the origin as the inversion center, Archimedes' spiral r=atheta inverts to the hyperbolic spiral r=a/theta.

The integral transform defined by (Kphi)(x)=int_0^infty(x^2-t^2)_+^(lambda/2)P_nu^lambda(t/x)phi(t)dt, where y_+^alpha is the truncated power function and P_nu^lambda(x) is ...

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...