Search Results for ""

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.

Simple majority vote is the only procedure which is anonymous, dual, and monotonic.

The generalization of the Schönflies theorem to n dimensions. A smoothly embedded n-hypersphere in an (n+1)-hypersphere separates the (n+1)-hypersphere into two components, ...

The radical circle of the McCay circles has center (1) which is not a Kimberling center, and radius (2) where (3) Its circle function is (4) where (5) which is also does not ...

If two square n×n matrices A and B are simultaneously upper triangularizable by similarity transforms, then there is an ordering a_1, ..., a_n of the eigenvalues of A and ...

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

For an infinite population with mean mu, variance sigma^2, skewness gamma_1, and kurtosis excess gamma_2, the corresponding quantities for the distribution of means are ...

The mean square displacement (MSD) of a set of N displacements x_n is given by <|x|^2>=sum_(k=1)^N|x_k|^2. It arises particularly in Brownian motion and random walk problems. ...