Search Results for ""

A fusene is a simple planar 2-connected graph embedded in the plane with all vertices of degree 2 or 3, all bounded faces (not necessarily regular) hexagons, and all vertices ...

A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...

The Laplacian matrix, sometimes also called the admittance matrix (Cvetković et al. 1998, Babić et al. 2002) or Kirchhoff matrix, of a graph G, where G=(V,E) is an ...

Discrete Mathematics

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

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 "binary" Champernowne constant is obtained by concatenating the binary representations of the integers C_2 = 0.(1)(10)(11)(100)(101)(110)(111)..._2 (1) = ...