Graceful Labeling

Graceful Labeling is a type of graph labeling in which each vertex is assigned a unique integer label from 0 to the number of edges such that the induced edge labels, defined as the absolute difference between the labels of the two endpoints, form a set of distinct integers from 1 to the number of edges.

31

Publications

630

Citations

51

Authors

33

Institutions

Publications per year

2017–2026

5

Variants

Graceful Graph Labeling

Authors

51

  1. SN
    S. N. Daoud

    Menoufia University, Egypt

    4 publications · 67 citations

    4

    h-index

  2. CB
    Christian Barrientos

    2 publications · 25 citations

    2

    h-index

  3. JŠ
    Jozef Širáň

    Slovak University of Technology in Bratislava, Slovakia

    2 publications · 57 citations

    2

    h-index

  4. LB
    Ljiljana Branković

    University of Newcastle Australia, Australia

    1 publications · 13 citations

    1

    h-index

  5. HH
    Heiko Harborth

    Technische Universität Braunschweig, Germany

    1 publications · 10 citations

    1

    h-index

1–5 of 51

Venues

  1. Discussiones Mathematicae Graph Theory

    DMGT · 3 publications · 34 citations

    3

    h-index

  2. Ars Combinatoria

    3 publications · 39 citations

    3

    h-index

  3. The Electronic Journal of Combinatorics

    2 publications · 51 citations

    2

    h-index

  4. Journal of Graph Theory

    2 publications · 102 citations

    2

    h-index

  5. Journal of Combinatorial Designs

    JCD · 1 publications · 27 citations

    1

    h-index

1–5