Abstract
A Skolem sequence can be thought of as a labelled path where two vertices with the same label are that distance apart. This concept has naturally been generalized to labellings of other graphs, but always using at most two of any integer label. Given that more than two vertices can be mutually distance d apart, we define a new generalization of a Skolem sequences on graphs that we call proper Skolem labellings. This brings rise to the question; ``what is the smallest set of consecutive positive integers we can use to proper Skolem label a graph?'' This will be known as the Skolem number of the graph. In this paper we give the Skolem number for cycles and grid graphs, while also providing other related results along the way.
Highlights
A Skolem sequence is a sequence S = (s1, s2, . . . s2n) consisting of two of each integer in {1, 2, . . . , n} so that whenever si = sj = k |i − j| = k
Given that more than two vertices can be mutually distance d apart, we define a new generalization of a Skolem sequence on graphs that we call a proper Skolem labelling
This brings rise to the question; “what is the smallest set of consecutive positive integers we can use to proper Skolem label a graph?” This will be known as the Skolem number of the graph
Summary
Follow this and additional works at: https://digitalcommons.georgiasouthern.edu/tag Part of the Discrete Mathematics and Combinatorics Commons. Recommended Citation Carrigan, Braxton and Asplund, John (2021) "Skolem Number of Cycles and Grid Graphs," Theory and Applications of Graphs: Vol 8 : Iss. 2 , Article 4.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
