Search Results for ""

A simple polyhedron, also called a simplicial polyhedron, is a polyhedron that is topologically equivalent to a sphere (i.e., if it were inflated, it would produce a sphere) ...

A square-free graph is a graph containing no graph cycles of length four. A simple graph is square-free iff c_4=1/8[Tr(A^4)-2m-2sum_(i!=j)a_(ij)^((2))]=0, where A is the ...

A Steiner system S(t,k,v) is a set X of v points, and a collection of subsets of X of size k (called blocks), such that any t points of X are in exactly one of the blocks. ...

A collection of subsets of a topological space that is contained in a basis of the topology and can be completed to a basis when adding all finite intersections of the ...

A lattice polygon formed by a three-choice walk. The anisotropic perimeter and area generating function G(x,y,q)=sum_(m>=1)sum_(n>=1)sum_(a>=a)C(m,n,a)x^my^nq^a, where ...

Three point geometry is a finite geometry subject to the following four axioms: 1. There exist exactly three points. 2. Two distinct points are on exactly one line. 3. Not ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p) and numbers are assigned to the edges of a grid. A b-cluster is an ...

The d-analog of a complex number s is defined as [s]_d=1-(2^d)/(s^d) (1) (Flajolet et al. 1995). For integer n, [2]!=1 and [n]_d! = [3][4]...[n] (2) = ...

There are several definitions of "almost Hamiltonian" in use. As defined by Punnim et al. (2007), an almost Hamiltonian graph is a graph on n nodes having Hamiltonian number ...

A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...