Search Results for ""

The adjacency list representation of a graph consists of n lists one for each vertex v_i, 1<=i<=n, which gives the vertices to which v_i is adjacent. The adjacency lists of a ...

A benzenoid is a fusene that is a subgraph of the regular hexagonal lattice (i.e., a simply connected polyhex). The numbers of n-hexagon benzenoids for n=1, 2, ... are 1, 1, ...

An infinite sequence of circles such that every four consecutive circles are mutually tangent, and the circles' radii ..., R_(-n), ..., R_(-1), R_0, R_1, R_2, R_3, R_4, ..., ...

A doublecross graph is a graph with graph crossing number 2. The numbers of doublecross simple graphs on n=1 nodes are 0, 0, 0, 0, 0, 1, 39, ..., and the numbers of connected ...

Gauss's forward formula is f_p=f_0+pdelta_(1/2)+G_2delta_0^2+G_3delta_(1/2)^3+G_4delta_0^4+G_5delta_(1/2)^5+..., (1) for p in [0,1], where delta is the central difference and ...

The function f_theta(z)=z/((1+e^(itheta)z)^2) (1) defined on the unit disk |z|<1. For theta in [0,2pi), the Köbe function is a schlicht function f(z)=z+sum_(j=2)^inftya_jz^j ...

Also known as metric entropy. Divide phase space into D-dimensional hypercubes of content epsilon^D. Let P_(i_0,...,i_n) be the probability that a trajectory is in hypercube ...

The n functions f_1(x), f_2(x), ..., f_n(x) are linearly dependent if, for some c_1, c_2, ..., c_n in R not all zero, sum_(i=1)^nc_if_i(x)=0 (1) for all x in some interval I. ...

The Poisson-Charlier polynomials c_k(x;a) form a Sheffer sequence with g(t) = e^(a(e^t-1)) (1) f(t) = a(e^t-1), (2) giving the generating function ...

Given a commutative unit ring R, and an R-module M, a sequence {x_1,...,x_n} of elements of R is called a regular sequence for M (or an M-sequence for short), if, for all ...