Search Results for ""

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

The Rogers-Ramanujan continued fraction is a generalized continued fraction defined by R(q)=(q^(1/5))/(1+q/(1+(q^2)/(1+(q^3)/(1+...)))) (1) (Rogers 1894, Ramanujan 1957, ...

There are two kinds of power sums commonly considered. The first is the sum of pth powers of a set of n variables x_k, S_p(x_1,...,x_n)=sum_(k=1)^nx_k^p, (1) and the second ...

A transformation of a polynomial equation f(x)=0 which is of the form y=g(x)/h(x) where g and h are polynomials and h(x) does not vanish at a root of f(x)=0. The cubic ...

Given a property P, if P(x)∼x as x->infty (so, using asymptotic notation, the number of numbers less than x not satisfying the property P is o(x), where o(x) is one of the ...

The average disorder number of a simple connected graph on n vertices is defined as the average length of a walk along the edges of the graph taken over all ordering of its ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number. Note that while a ...

Marsaglia (1972) has given a simple method for selecting points with a uniform distribution on the surface of a 4-sphere. This is accomplished by picking two pairs of points ...

A dot plot, also called a dot chart, is a type of simple histogram-like chart used in statistics for relatively small data sets where values fall into a number of discrete ...