Search Results for ""

A theorem of fundamental importance in spectroscopy and angular momentum theory which provides both (1) an explicit form for the dependence of all matrix elements of ...

Let a piecewise smooth function f with only finitely many discontinuities (which are all jumps) be defined on [-pi,pi] with Fourier series a_k = 1/piint_(-pi)^pif(t)cos(kt)dt ...

A symbol consisting of three rational numbers that can be used to describe uniform polyhedra based on how a point C in a spherical triangle can be selected so as to trace the ...

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...

Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...

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

A prism graph, denoted Y_n, D_n (Gallian 1987), or Pi_n (Hladnik et al. 2002), and sometimes also called a circular ladder graph and denoted CL_n (Gross and Yellen 1999, p. ...

If r is a root of a nonzero polynomial equation a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, (1) where the a_is are integers (or equivalently, rational numbers) and r satisfies no ...