Search Results for ""

A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...

A primitive polynomial is a polynomial that generates all elements of an extension field from a base field. Primitive polynomials are also irreducible polynomials. For any ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

The score sequence of a tournament is a monotonic nondecreasing sequence of the outdegrees of the graph vertices of the corresponding tournament graph. Elements of a score ...

The number of cells in a generalized Chinese checkers board (or "centered" hexagram). Unlike the polygonal numbers, there is ambiguity in the case of the star numbers as to ...

A tag system is set of rules that specifies a fixed number of elements (commonly denoted nu or beta) be removed from the beginning of a sequence and a set of elements to be ...

The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...

Let c_k be the number of vertex covers of a graph G of size k. Then the vertex cover polynomial Psi_G(x) is defined by Psi_G(x)=sum_(k=0)^(|G|)c_kx^k, (1) where |G| is the ...

The sextic curve also known as atriphtothlassic curve and given by the equation x^4(x^2+y^2)-(ax^2-b)^2=0, where a,b>0.

Let f:R×R->R be a one-parameter family of C^2 map satisfying f(0,0)=0 [(partialf)/(partialx)]_(mu=0,x=0)=0 [(partial^2f)/(partialx^2)]_(mu=0,x=0)>0 ...