Search Results for ""

There are several sorts of graphs referred to as "star graphs" in mathematics, computer science, and information processing. The most common sort of star is the n-star graph ...

A planar hypotraceable graph is a hypotraceable graph that is also planar. A number of planar hypotraceable graphs are illustrated above. Using a theorem of Thomassen (1974), ...

Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are ...

A factor of a polynomial P(x) of degree n is a polynomial Q(x) of degree less than n which can be multiplied by another polynomial R(x) of degree less than n to yield P(x), ...

The set R union {infty}, obtained by adjoining one improper element to the set R of real numbers, is the set of projectively extended real numbers. Although notation is not ...

The word quantile has no fewer than two distinct meanings in probability. Specific elements x in the range of a variate X are called quantiles, and denoted x (Evans et al. ...

The R graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RGraph"].

A primality test that provides an efficient probabilistic algorithm for determining if a given number is prime. It is based on the properties of strong pseudoprimes. The ...

A rational number is a number that can be expressed as a fraction p/q where p and q are integers and q!=0. A rational number p/q is said to have numerator p and denominator ...

The resolution principle, due to Robinson (1965), is a method of theorem proving that proceeds by constructing refutation proofs, i.e., proofs by contradiction. This method ...