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
Parents
31
Exploring New Cryptographical Construction of Complex Network Data
Hongyu Wang, Jin Xu, Bing Yao · 2016 · 67 citations
On sequential labelings of graphs
Thom Grace · Journal of Graph Theory · 1983 · 57 citations
1–5 of 31
51
4
h-index
2 publications · 25 citations
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 51
33

Menoufia University
Shibīn al Kawm, Egypt
3 h-index
3 publications
53 citations

Taibah University
Medina, Saudi Arabia
2 h-index
2 publications
41 citations

Benha University
Banhā, Egypt
2 h-index
4 publications
46 citations

Slovak University of Technology in Bratislava
Bratislava, Slovakia
2 h-index
2 publications
57 citations
Technische Universität Braunschweig
Braunschweig, Germany
1 h-index
2 publications
20 citations

Nihon University
Tokyo, Japan
1 h-index
1 publications
12 citations

Sapienza University of Rome
Rome, Italy
1 h-index
1 publications
27 citations

Comenius University Bratislava
Bratislava, Slovakia
1 h-index
1 publications
25 citations
1–8 of 33
DMGT · 3 publications · 34 citations
3
h-index
3 publications · 39 citations
3
h-index
2 publications · 51 citations
2
h-index
2 publications · 102 citations
2
h-index
JCD · 1 publications · 27 citations
1
h-index
1–5