Search Results for ""

The set of all edge automorphisms of G, denoted Aut^*(G). Let L(G) be the line graph of a graph G. Then the edge automorphism group Aut^*(G) is isomorphic to Aut(L(G)), ...

A proof which can be accomplished using only real numbers (i.e., real analysis instead of complex analysis; Hoffman 1998, pp. 92-93).

delta(r)=sqrt(r)-2alpha(r), where alpha(r) is the elliptic alpha function.

A proof of a formula on limits based on the epsilon-delta definition. An example is the following proof that every linear function f(x)=ax+b (a,b in R,a!=0) is continuous at ...

Two matrices A and B are equal to each other, written A=B, if they have the same dimensions m×n and the same elements a_(ij)=b_(ij) for i=1, ..., n and j=1, ..., m. ...

The series sumf(n) for a monotonic nonincreasing f(x) is convergent if lim_(x->infty)^_(e^xf(e^x))/(f(x))<1 and divergent if lim_(x->infty)__(e^xf(e^x))/(f(x))>1.

A more common way to describe a Euclidean ring.

A weighted graph in which the weights are equal to the Euclidean lengths of the edges in a specified embedding (Skiena 1990, pp. 201 and 252).

The derivative (deltaL)/(deltaq)=(partialL)/(partialq)-d/(dt)((partialL)/(partialq^.)) appearing in the Euler-Lagrange differential equation.

Consider a function f(x) in one dimension. If f(x) has a relative extremum at x_0, then either f^'(x_0)=0 or f is not differentiable at x_0. Either the first or second ...