Search Results for ""

The upper irredundance number IR(G) of a graph G is the maximum size of an irredundant set of vertices in G. It is therefore equal to the size of a maximum irredundant set as ...

The Lorenz curve is used in economics and ecology to describe inequality in wealth or size. The Lorenz curve is a function of the cumulative proportion of ordered individuals ...

To multiply the size of a d-D object by a factor a, c=a^d copies are required, and the quantity d=(lnc)/(lna) is called the similarity dimension.

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

The parameter r in the exponential equation of population growth N(t)=N_0e^(rt), where N_0 is the initial population size (at t=0) and t is the elapsed time.

The dimension of a partially ordered set P=(X,<=) is the size of the smallest realizer of P. Equivalently, it is the smallest integer d such that P is isomorphic to a ...

A transversal design TD_lambda(k,n) of order n, block size k, and index lambda is a triple (V, G, B) such that 1. V is a set of kn elements, 2. G is a partition of V into k ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...