Search Results for ""

The Lotka-Volterra equations describe an ecological predator-prey (or parasite-host) model which assumes that, for a set of fixed positive constants A (the growth rate of ...

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

The first few prime Lucas numbers L_n are 2, 3, 7, 11, 29, 47, 199, 521, 2207, 3571, ... (OEIS A005479), corresponding to indices n=0, 2, 4, 5, 7, 8, 11, 13, 16, 17, 19, 31, ...

Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...

A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...

A maximal independent vertex set of a graph is an independent vertex set that cannot be expanded to another independent vertex set by addition of any vertex in the graph. A ...

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

There are several statistical quantities called means, e.g., harmonic mean, geometric mean, arithmetic-geometric mean, and root-mean-square. When applied to two elements a ...

A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...

The metric dimension beta(G) (Tillquist et al. 2021) or dim(G) (Tomescu and Javid 2007, Ali et al. 2016) of a graph G is the smallest number of nodes required to identify all ...