Search Results for ""

An ungraceful graph is a simple graph that does not possess a graceful labeling, i.e., a graph that is not a graceful graph (Gardner 1972). Such graphs have also been termed ...

A unicyclic graph is a connected graph containing exactly one cycle (Harary 1994, p. 41). A connected unicyclic graph is therefore a pseudotree that is not a tree. ...

An apodization function A(x)=1, (1) having instrument function I(k)=2asinc(2pika). (2) The peak of I(k) is 2a. The full width at half maximum of I(k) can found by setting ...

A particle P is said to be undergoing uniform circular motion if its radius vector in appropriate coordinates has the form (x(t),y(t),0), where x(t) = Rcos(omegat) (1) y(t) = ...

Let A be a C^*-algebra having no unit. Then A^~=A direct sum C as a vector spaces together with 1. (a,lambda)+(b,mu)=(a+b,lambda+mu). 2. mu(a,lambda)=(mua,mulambda). 3. ...

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

If y has period 2pi, y^' is L^2, and int_0^(2pi)ydx=0, (1) then int_0^(2pi)y^2dx<int_0^(2pi)y^('2)dx (2) unless y=Acosx+Bsinx (3) (Hardy et al. 1988). Another inequality ...

"The" Y-graph is another term used to refer to a claw graph. The term "Y-graph" is also used to refer to a graph expansion with the Y graph as its base (e.g., Horton and ...