Search Results for ""

A maximal independent set is an independent set which is a maximal set, i.e., an independent set that is not a subset of any other independent set. The generic term "maximal ...

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

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 set of vectors is maximally linearly independent if including any other vector in the vector space would make it linearly dependent (i.e., if any other vector in the space ...

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 maximum degree, sometimes simply called the maximum degree, of a graph G is the largest vertex degree of G, denoted Delta.

For every infinite loop space machine E, there is a natural equivalence of spectra between EX and Segal's spectrum BX.

Let a function h:U->R be continuous on an open set U subset= C. Then h is said to have the epsilon_(z_0)-property if, for each z_0 in U, there exists an epsilon_(z_0)>0 such ...

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