Search Results for ""

The score sequence of a tournament is a monotonic nondecreasing sequence of the outdegrees of the graph vertices of the corresponding tournament graph. Elements of a score ...

A self-complementary graph is a graph which is isomorphic to its graph complement. The numbers of simple self-complementary graphs on n=1, 2, ... nodes are 1, 0, 0, 1, 2, 0, ...

A semiperfect magic cube, sometimes also called an "Andrews cube" (Gardner 1976; Gardner 1988, p. 219) is a magic cube for which the cross section diagonals do not sum to the ...

A list of five properties of a topological space X expressing how rich the "population" of open sets is. More precisely, each of them tells us how tightly a closed subset can ...

In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...

Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...

Sexy primes are pairs of primes of the form (p, p+6), so-named since "sex" is the Latin word for "six.". The first few sexy prime pairs are (5, 11), (7, 13), (11, 17), (13, ...

Let alpha(G) denote the independence number of a graph G. Then the Shannon capacity Theta(G), sometimes also denoted c(G), of G is defined as ...

A sequence s_n(x) is called a Sheffer sequence iff its generating function has the form sum_(k=0)^infty(s_k(x))/(k!)t^k=A(t)e^(xB(t)), (1) where A(t) = A_0+A_1t+A_2t^2+... ...

A Sierpiński number of the first kind is a number of the form S_n=n^n+1. The first few are 2, 5, 28, 257, 3126, 46657, 823544, 16777217, ... (OEIS A014566). Sierpiński proved ...