Search Results for ""
11 - 20 of 299 for size]Search Results
A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number. Note that while a ...
A portion of the Mandelbrot set centered around 0.3+0i with size approximately 0.1+0.1i.
The limit of a lower sum, when it exists, as the mesh size approaches 0.
A nowhere-neat dissection in which squares of the same size are not allowed to share any part of a side.
The kth percentile P_k is that value of x, say x_k, which corresponds to a cumulative frequency of Nk/100, where N is the sample size.
The limit of an upper sum, when it exists, as the mesh size approaches 0.
A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...
A minimum dominating set is a dominating set of smallest size in a given graph. The size of a minimum dominating set is known as the domination number of the graph. A minimum ...
If there exists a critical region C of size alpha and a nonnegative constant k such that (product_(i=1)^(n)f(x_i|theta_1))/(product_(i=1)^(n)f(x_i|theta_0))>=k for points in ...
The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...
...