Search Results for ""

An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...

A number k such that nk^2 has its last digit(s) equal to k is called n-automorphic. For example, 1·5__^2=25__ (Wells 1986, pp. 58-59) and 1·6__^2=36__ (Wells 1986, p. 68), so ...

An automorphism is an isomorphism of a system of objects onto itself. The term derives from the Greek prefix alphaupsilontauomicron (auto) "self" and ...

The group of functions from an object G to itself which preserve the structure of the object, denoted Aut(G). The automorphism group of a group preserves the multiplication ...

A differential equation or system of ordinary differential equations is said to be autonomous if it does not explicitly contain the independent variable (usually denoted t). ...

The circumcircle of an ellipse, i.e., the circle whose center concurs with that of the ellipse and whose radius is equal to the ellipse's semimajor axis.

alpha=1/Nsum_(i=1)^N|x_i-mu|=<|x_i-mu|>.

The average disorder number of a simple connected graph on n vertices is defined as the average length of a walk along the edges of the graph taken over all ordering of its ...

If f is continuous on a closed interval [a,b], then there is at least one number x^* in [a,b] such that int_a^bf(x)dx=f(x^*)(b-a). The average value of the function (f^_) on ...

The average power of a complex signal f(t) as a function of time t is defined as <f^2(t)>=lim_(T->infty)1/(2T)int_(-T)^T|f(t)|^2dt, where |z| is the complex modulus (Papoulis ...