Search Results for ""

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...

Let R[z]>0, 0<=alpha,beta<=1, and Lambda(alpha,beta,z)=sum_(r=0)^infty[lambda((r+alpha)z-ibeta)+lambda((r+1-alpha)z+ibeta)], (1) where lambda(x) = -ln(1-e^(-2pix)) (2) = ...

The Ishango bone is the oldest known object containing logical carvings. It was discovered in the Congo, and has been dated to be 22000 years old. The middle column of marks ...

The term isocline derives from the Greek words for "same slope." For a first-order ordinary differential equation y^'=f(t,y) is, a curve with equation f(t,y)=C for some ...

An isogonal mapping is a transformation w=f(z) that preserves the magnitudes of local angles, but not their orientation. A few examples are illustrated above. A conformal ...

The term "isomorphic" means "having the same form" and is used in many branches of mathematics to identify mathematical objects which have the same structural properties. ...

Some elements of a group G acting on a space X may fix a point x. These group elements form a subgroup called the isotropy group, defined by G_x={g in G:gx=x}. For example, ...

Find the surface enclosing the maximum volume per unit surface area, I=V/S. The solution is a sphere, which has I_(sphere)=(4/3pir^3)/(4pir^2)=1/3r. The fact that a sphere ...

An iterated map is a map that is applied repeatedly to an object. The Wolfram Language function NestList[f, expr, n] gives a list of the results of iterating the function f n ...