Search Results for ""

A topologically invariant property of a surface defined as the largest number of nonintersecting simple closed curves that can be drawn on the surface without separating it. ...

A two-coloring of a complete graph K_n of n nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of R+B where R and B are ...

The Harary graph H_(k,n) is a particular example of a k-connected graph with n graph vertices having the smallest possible number of edges. The smallest number of edges ...

A holyhedron is polyhedron whose faces and holes are all finite-sided polygons and that contains at least one hole whose boundary shares no point with a face boundary. D. ...

Divide a set of data into two groups (high and low) of equal size at the statistical median if there is an even number of data points, or two groups consisting of points on ...

An inverse permutation is a permutation in which each number and the number of the place which it occupies are exchanged. For example, p_1 = {3,8,5,10,9,4,6,1,7,2} (1) p_2 = ...

The word multiplicity is a general term meaning "the number of values for which a given condition holds." For example, the term is used to refer to the value of the totient ...

nu(x) = int_0^infty(x^tdt)/(Gamma(t+1)) (1) nu(x,alpha) = int_0^infty(x^(alpha+t)dt)/(Gamma(alpha+t+1)), (2) where Gamma(z) is the gamma function (Erdélyi et al. 1981, p. ...

The word "order" is used in a number of different ways in mathematics. Most commonly, it refers to the number of elements in (e.g., conjugacy class order, graph order, group ...

Parametric equations are a set of equations that express a set of quantities as explicit functions of a number of independent variables, known as "parameters." For example, ...