Search Results for ""

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

Let T be a maximal torus of a group G, then T intersects every conjugacy class of G, i.e., every element g in G is conjugate to a suitable element in T. The theorem is due to ...

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...

A maximum likelihood estimator is a value of the parameter a such that the likelihood function is a maximum (Harris and Stocket 1998, p. 824).

The mean clustering coefficient of a graph G is the average of the local clustering coefficients of G. It is implemented in the Wolfram Language as ...

A Boolean sigma-algebra which possesses a measure.

P_n(cosalpha)=(sqrt(2))/piint_0^alpha(cos[(n+1/2)phi])/(sqrt(cosphi-cosalpha))dphi, where P_n(x) is a Legendre polynomial.

(e^(ypsi_0(x))Gamma(x))/(Gamma(x+y))=product_(n=0)^infty(1+y/(n+x))e^(-y/(n+x)), where psi_0(x) is the digamma function and Gamma(x) is the gamma function.

The metabidiminished rhombicosidodecahedron is a convex equilateral solid that is Johnson solid J_(81). The unit metabidiminished rhombicosidodecahedron has volume ...