Search Results for ""

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

The upper half-plane is the portion of the complex plane {x+iy:x,y in (-infty,infty)} satisfying y=I[z]>0 i.e., {x+iy:x in (-infty,infty),y in (0,infty)}. Common notations ...

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

A triangular matrix U of the form U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... a_(nn)]. ...

For a second-order ordinary differential equation, y^('')+p(x)y^'+q(x)y=g(x). (1) Assume that linearly independent solutions y_1(x) and y_2(x) are known to the homogeneous ...

Let a vault consist of two equal half-cylinders of radius r which intersect at right angles so that the lines of their intersections (the "groins") terminate in the ...

The Weibull distribution is given by P(x) = alphabeta^(-alpha)x^(alpha-1)e^(-(x/beta)^alpha) (1) D(x) = 1-e^(-(x/beta)^alpha) (2) for x in [0,infty), and is implemented in ...

Let all of the functions f_n(z)=sum_(k=0)^inftya_k^((n))(z-z_0)^k (1) with n=0, 1, 2, ..., be regular at least for |z-z_0|<r, and let F(z) = sum_(n=0)^(infty)f_n(z) (2) = (3) ...

A tree to whose nodes and/or edges labels (usually number) are assigned. The word "weight" also has a more specific meaning when applied to trees, namely the weight of a tree ...

Let B_n(r) be the n-dimensional closed ball of radius r>1 centered at the origin. A function which is defined on B(r) is called an extension to B(r) of a function f defined ...