• Corpus ID: 17435854

Skolem circles

  title={Skolem circles},
  author={James Bubear and Joanne Hall},
  journal={Bull. ICA},
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. 

Figures and Tables from this paper

Skolem Number of Subgraphs on the Triangular Lattice
The Skolem number is given for three natural vertex induced subgraphs of the triangular lattice graph.
Skolem Number of Cycles and Grid Graphs
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.


Langford sequences and a product of digraphs
A survey of Skolem-type sequences and Rosa’s use of them
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
Skolem labelled graphs
Langford sequences: perfect and hooked
Node-graceful graphs
Word-Oriented Transformation Shift Registers and Their Linear Complexity
The notion of word-oriented nonlinearly filtered primitive transformation shift registers based on a Langford arrangement and their linear complexity are introduced.
On Ryser's conjecture for linear intersecting multipartite hypergraphs
1‐Rotational Steiner triple systems over arbitrary groups
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
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,