Search Results for ""

Discrete Mathematics

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

An AB percolation is a discrete percolation model in which the underlying point lattice graph L has the properties that each of its graph vertices is occupied by an atom ...

Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...

The attractor of the iterated function system given by the set of "fern functions" f_1(x,y) = [0.85 0.04; -0.04 0.85][x; y]+[0.00; 1.60] (1) f_2(x,y) = [-0.15 0.28; 0.26 ...

The bei_nu(z) function is defined through the equation J_nu(ze^(3pii/4))=ber_nu(z)+ibei_nu(z), (1) where J_nu(z) is a Bessel function of the first kind, so ...

The converse of Pascal's theorem, which states that if the three pairs of opposite sides of (an irregular) hexagon meet at three collinear points, then the six vertices lie ...