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

The inner Napoleon triangle is the triangle DeltaN_AN_BN_C formed by the centers of internally erected equilateral triangles DeltaABE_C, DeltaACE_B, and DeltaBCE_A on the ...

Let A^' be the outermost vertex of the regular pentagon erected inwards on side BC of a reference triangle DeltaABC. Similarly, define B^' and C^'. The triangle ...

The inner Soddy center (or inner Soddy point) is the center of the inner Soddy circle. It is equivalent to the equal detour point X_(175) (Kimberling 1994) and has equivalent ...

Let Q(x)=Q(x_1,x_2,...,x_n) be an integer-valued n-ary quadratic form, i.e., a polynomial with integer coefficients which satisfies Q(x)>0 for real x!=0. Then Q(x) can be ...

Integration under the integral sign is the use of the identity int_a^bdxint_(alpha_0)^alphaf(x,alpha)dalpha=int_(alpha_0)^alphadalphaint_a^bf(x,alpha)dx (1) to compute an ...

The sum I over all internal (circular) nodes of the paths from the root of an extended binary tree to each node. For example, in the tree above, the internal path length is ...

An intrinsically linked graph is a graph having the property that any embedding of it in three dimensions contains a nontrivial link. A graph is intrinsically linked iff it ...

The Radon inverse transform is an integral transform that has found widespread application in the reconstruction of images from medical CT scans. The Radon and inverse Radon ...