Search Results for ""

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

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

A set of real numbers x_1, ..., x_n is said to possess an integer relation if there exist integers a_i such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. For ...

A sequence whose terms are integers. The most complete printed references for such sequences are Sloane (1973) and its update, Sloane and Plouffe (1995). Neil Sloane ...

Iofinova and Ivanov (1985) showed that there exist exactly five bipartite cubic semisymmetric graphs whose automorphism groups preserves the bipartite parts and acts ...

An irrational number is a number that cannot be expressed as a fraction p/q for any integers p and q. Irrational numbers have decimal expansions that neither terminate nor ...

The Jacobi elliptic functions are standard forms of elliptic functions. The three basic functions are denoted cn(u,k), dn(u,k), and sn(u,k), where k is known as the elliptic ...

Given a group of n men arranged in a circle under the edict that every mth man will be executed going around the circle until only one remains, find the position L(n,m) in ...

A Keith number is an n-digit integer N>9 such that if a Fibonacci-like sequence (in which each term in the sequence is the sum of the n previous terms) is formed with the ...

Let x=[a_0;a_1,...]=a_0+1/(a_1+1/(a_2+1/(a_3+...))) (1) be the simple continued fraction of a "generic" real number x, where the numbers a_i are the partial denominator. ...