On Skolem graceful graphs (Q1182894): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(91)90255-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977828196 / rank
 
Normal rank

Latest revision as of 10:59, 30 July 2024

scientific article
Language Label Description Also known as
English
On Skolem graceful graphs
scientific article

    Statements

    On Skolem graceful graphs (English)
    0 references
    28 June 1992
    0 references
    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.
    0 references
    Skolem sequence
    0 references
    labeling of a graph
    0 references
    deficiency
    0 references
    0 references
    0 references

    Identifiers