Search Results for ""

The smallest nontrivial taxicab number, i.e., the smallest number representable in two ways as a sum of two cubes. It is given by 1729=1^3+12^3=9^3+10^3. The number derives ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

A number which is simultaneously square and triangular. Let T_n denote the nth triangular number and S_m the mth square number, then a number which is both triangular and ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

On the Clebsch diagonal cubic, all 27 of the complex lines present on a general smooth cubic surface are real. In addition, there are 10 points on the surface where three of ...

A pair of values x and y one or both of which is complex.

Three concurrent homologous lines pass respectively through three fixed points on the similitude circle which are known as the invariable points.

A node in a graph for which the graph eccentricity equals the graph diameter (Harary 1994, p. 41).

A pole of multiplicity less than p+1.

The nth Smarandache-Wellin number is formed from the consecutive number sequence obtained by concatenating of the digits of the first n primes. The first few are 2, 23, 235, ...