Skolem sequences and Skolem labeled graphs have been described and examined for several decades. This note explores weak Skolem labelling of cycle graphs, which we call Skolem circles. The relationship between Skolem sequences and Skolem cirlces is explored, and Skolem circles of small sizes are enumerated, with some loose general bounds established.

The Skolem number is given, which is the smallest set of consecutive positive integers that one can use to properSkolem label a graph, and is provided for cycles and grid graphs.Expand

Let D be a set of positive integers. A Skolem-type sequence is a sequence of i ∈ D such that every i ∈ D appears exactly twice in the sequence at positions ai and bi, and |bi − ai| = i. These… Expand

The notion of word-oriented nonlinearly filtered primitive transformation shift registers based on a Langford arrangement and their linear complexity are introduced.Expand

Phelps and Rosa introduced the concept of 1‐rotational Steiner triple system, that is an STS(ν) admitting an automorphism consisting of a fixed point and a single cycle of length ν − 1 [Discrete… Expand

Any Problem (as I shall use the term) would be a proposition pronouncing, in effect, that under circumstances known to exist or to be possible, a certain sort of result, described partly, at least,… Expand