On Skolem graceful graphs (Q1182894): Difference between revisions

Using the concept of a Skolem sequence \(\{u_ 1,\ldots,u_{2n}\}\) of \(2n\geq 2\) terms, \(u_ i\in\mathbb{N}\), the authors introduce a new kind of vertex labeling of a graph \(G=(V,E)\) arising from the well-known concept of the graceful labeling of \(G\) by substituting the graceful (injective) mapping \(f:V\to\{0,1,\ldots,| E|\}\) by \(f:V\to\{1,2,\ldots,| E|\}\), prove some easy facts, and determine some classes of Skolem graceful graphs. Furthermore, they introduce the notions of the Skolem deficiency of \(G\) and the universal finiteness of a subclass of the class of all finite graphs and conclude by giving some funny results.