Search Results for ""

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

The maximum leaf number l(G) of a graph G is the largest number of tree leaves in any of its spanning trees. (The corresponding smallest number of leaves is known as the ...

The vertex cover number is the size of a minimum vertex cover in a graph G is known as the vertex cover number of G, denoted tau(G). The König-Egeváry theorem states that the ...

1%.

An estimator of the actual values of population.

A figurate number of the form 4n^2-3n. The first few are 1, 10, 27, 52, 85, ... (OEIS A001107). The generating function giving the decagonal numbers is ...

By way of analogy with the eban numbers, iban numbers are defined as numbers whose English names do not contain the letter "i" (i.e., "i" is banned). The first few are 1, 2, ...

The heptanacci numbers are a generalization of the Fibonacci numbers defined by H_0=0, H_1=1, H_2=1, H_3=2, H_4=4, H_5=8, H_6=16, and the recurrence relation ...

The hexanacci numbers are a generalization of the Fibonacci numbers defined by H_0=0, H_1=1, H_2=1, H_3=2, H_4=4, H_5=8, and the recurrence relation ...