Search Results for ""

An independent dominating set of a graph G is a set of vertices in G that is both an independent vertex set and a dominating set of G. The minimum size of an independent ...

An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...

An independent variable is a variable whose values don't depend on changes in other variables. This is in contrast to the definition of dependent variable. As with dependent ...

An indicial equation, also called a characteristic equation, is a recurrence equation obtained during application of the Frobenius method of solving a second-order ordinary ...

An indirectly conformal mapping, sometimes called an anticonformal mapping, is a mapping that reverses all angles, whereas an isogonal mapping can reverse some angles and ...

If a subgroup H of G has a group representation phi:H×W->W, then there is a unique induced representation of G on a vector space V. The original space W is contained in V, ...

Given a sequence of real numbers a_n, the infimum limit (also called the limit inferior or lower limit), written lim inf and pronounced 'lim-inf,' is the limit of ...

Let sigma_infty(n) be the sum of the infinitary divisors of a number n. An infinitary perfect number is a number n such that sigma_infty(n)=2n. The first few are 6, 60, 90, ...

A real-valued univariate function f=f(x) is said to have an infinite discontinuity at a point x_0 in its domain provided that either (or both) of the lower or upper limits of ...

A set of elements S is said to be infinite if the elements of a proper subset S^' can be put into one-to-one correspondence with the elements of S. An infinite set whose ...