Search Results for ""

A number which is simultaneously octagonal and heptagonal. Let O_m denote the mth octagonal number and H_n the nth heptagonal number, then a number which is both octagonal ...

A number which is simultaneously octagonal and pentagonal. Let O_n denote the nth octagonal number and P_m the mth pentagonal number, then a number which is both octagonal ...

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

A figurate number which is constructed as a centered cube with a square pyramid appended to each face, RhoDod_n = CCub_n+6P_(n-1)^((4)) (1) = (2n-1)(2n^2-2n+1), (2) where ...

A figurate number which is constructed as an octahedral number with a square pyramid removed from each of the six graph vertices, TO_n = O_(3n-2)-6P_(n-1)^((4)) (1) = ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

A number D that possesses no common divisor with a prime number p is either a quadratic residue or nonresidue of p, depending whether D^((p-1)/2) is congruent mod p to +/-1.

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