Labeling Number
Labeling Number is a numerical parameter in graph labeling theory that denotes the minimum integer range required to assign labels to the vertices or edges of a graph under specific constraints, distinguishing it from other graph invariants by its dependence on the labeling rule and its role in characterizing the labeling efficiency.
35
Publications
3.1K
Citations
74
Authors
36
Institutions
Publications per year
2017–2026
2
Parents
35
The $L(2,1)$-Labeling Problem on Graphs
Gerard J. Chang, David Kuo · SIAM Journal on Discrete Mathematics · 1996 · 371 citations
1–5 of 35
74
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 74
36

Vidyasagar University
Medinīpur, India
3 h-index
5 publications
84 citations
Saurashtra University
Rajkot, India
2 h-index
2 publications
25 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
2 h-index
5 publications
415 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
3 publications
93 citations
Norwich University
Northfield, United States
2 h-index
4 publications
88 citations
Hong Kong Baptist University
Hong Kong, Hong Kong
2 h-index
4 publications
56 citations
University of South Carolina
Columbia, United States
2 h-index
2 publications
47 citations
National Institute of Technology Durgapur
Durgapur, India
2 h-index
2 publications
28 citations
1–8 of 36
6 publications · 1.5K citations
6
h-index
4 publications · 67 citations
4
h-index
2 publications · 50 citations
2
h-index
TJM · 2 publications · 48 citations
2
h-index
1 publications · 19 citations
1
h-index
1–5