Search Results for ""

A maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...

The Maxwell (or Maxwell-Boltzmann) distribution gives the distribution of speeds of molecules in thermal equilibrium as given by statistical mechanics. Defining a=sqrt(kT/m), ...

Maxwell's equations are the system of partial differential equations describing classical electromagnetism and therefore of central importance in physics. In the so-called ...

The McCarthy-91 function is the recursive function defined for positive integer n by M(n)={M(M(n+11)) for n<=100; n-10 for n>100. (1) It takes the value 91 for all n=1, 2, ...

A subset E of a topological space S is said to be meager if E is of first category in S, i.e., if E can be written as the countable union of subsets which are nowhere dense ...

The mean distance of a (connected) graph is the mean of the elements of its graph distance matrix. Closed forms for some classes of named graphs are given in the following ...

A function f:X->R is measurable if, for every real number a, the set {x in X:f(x)>a} is measurable. When X=R with Lebesgue measure, or more generally any Borel measure, then ...

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

The integral transform defined by g(x)=int_1^inftyt^(1/4-nu/2)(t-1)^(1/4-nu/2)P_(-1/2+ix)^(nu-1/2)(2t-1)f(t)dt (Samko et al. 1993, p. 761) or ...

For x>0, J_0(x) = 2/piint_0^inftysin(xcosht)dt (1) Y_0(x) = -2/piint_0^inftycos(xcosht)dt, (2) where J_0(x) is a zeroth order Bessel function of the first kind and Y_0(x) is ...