• Mathematics
  • Published 2016

Skolem Circles

@inproceedings{Bubear2016SkolemC,
  title={Skolem Circles},
  author={James Bubear and Joanne Hall},
  year={2016}
}
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.

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

A survey of Skolem - type sequences and Rosa ’ s use of them

D. F. Hsu
  • Math . Slovaca
  • 2009

Node - graceful graphs

E. Shalaby
  • Comput . Math . Appl .
  • 1988

Exponential lower bounds for the number of Skolem and extremal Langford sequences

A. Kotzig
  • Ars Combin .
  • 1986

Skolem sequences and additive permutations

E. Mendelsohn
  • Discrete Math .
  • 1981

A natural generalization of Steiner triple systems . Computers in number theory

Herke B. D. McKay N. Francetic, Ian M. Wanless
  • Proc . of the Science Research Council Atlas Symposium no . 2 ,
  • 1971