Search Results for ""

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

For any real number r>=0, an irrational number alpha can be approximated by infinitely many rational fractions p/q in such a way that ...

A finite field is a field with a finite field order (i.e., number of elements), also called a Galois field. The order of a finite field is always a prime or a power of a ...

The function frac(x) giving the fractional (noninteger) part of a real number x. The symbol {x} is sometimes used instead of frac(x) (Graham et al. 1994, p. 70; Havil 2003, ...

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...

A Moore graph of type (v,g) is a regular graph of vertex degree v>2 and girth g that contains the maximum possible number of nodes, namely ...

The natural logarithm lnx is the logarithm having base e, where e=2.718281828.... (1) This function can be defined lnx=int_1^x(dt)/t (2) for x>0. This definition means that e ...

A quadratic map is a quadratic recurrence equation of the form x_(n+1)=a_2x_n^2+a_1x_n+a_0. (1) While some quadratic maps are solvable in closed form (for example, the three ...