Let a, b and n be nonnegative integers (b ≥ a, b > 0, n ≥ 1), Gn(a, b) be a multigraph on n vertices in which any pair of vertices is connected with at least a and at most b edges and v = (v1, v2, .… (More)

Let a, b (b ≥ a) and n (n ≥ 2) be nonnegative integers and let T (a, b, n) be the set of such generalized tournaments, in which every pair of distinct players is connected at most with b, and at… (More)

Given non-negative integers ni and αi with 0 ≤ αi ≤ ni (i = 1, 2, . . . , k), an [α1, α2, . . . , αk]-k-partite hypertournament on ∑k 1 ni vertices is a (k+ 1)-tuple (U1, U2, . . . , Uk, E), where Ui… (More)

In the paper we report on the parallel enumeration of the degree sequences (their number is denoted by G(n)) and zerofree degree sequences (their number is denoted by (Gz(n)) of simple graphs on n =… (More)

An (n, a, b)-perfect double cube is a b× b× b sized n-ary periodic array containing all possible a × a × a sized n-ary array exactly once as subarray. A growing cube is an array whose cj × cj × cj… (More)

Let n (1 ≤ n) be an integer and X = [xij ]1≤i,j≤n be an n× n sized matrix of independent random variables having joint uniform distribution Pr{xij = k for 1 ≤ k ≤ n} = 1 n (1 ≤ i, j ≤ n). A… (More)

Let ξ be a random integer vector, having uniform distribution P{ξ = (i1, i2, . . . , in) = 1/n} for 1 ≤ i1, i2, . . . , in ≤ n. A realization (i1, i2, . . . , in) of ξ is called good, if its elements… (More)

Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page frames increases. Belady, Nelson… (More)