L-Labeling is a specific graph labeling method within the field of graph theory that assigns labels to vertices or edges according to a constrained set of adjacency-based distance conditions derived from the L(h, k)-labeling problem.
69
Publications
3.5K
Citations
133
Authors
61
Institutions
Publications per year
2017–2026
2
Parents
Publications
69
The $L(2,1)$-Labeling Problem on Graphs
Gerard J. Chang, David Kuo · SIAM Journal on Discrete Mathematics · 1996 · 371 citations
1–5 of 69
Authors
133
- TC
6
h-index
- ES
5
h-index
- PK
4
h-index
- RK
4
h-index
- DW
4
h-index
1–5 of 133
Institutions
61
Sapienza University of Rome
Rome, Italy
5 h-index
9 publications
425 citations
University of Nevada, Las Vegas
Las Vegas, United States
3 h-index
4 publications
55 citations
University of Houston
Houston, United States
3 h-index
6 publications
236 citations
Franklin W. Olin College of Engineering
Needham, United States
3 h-index
8 publications
102 citations
Hong Kong Baptist University
Hong Kong, Hong Kong
3 h-index
6 publications
100 citations
Vidyasagar University
Medinīpur, India
3 h-index
6 publications
110 citations
Babson College
Wellesley, United States
3 h-index
4 publications
52 citations
University of Maribor
Maribor, Slovenia
2 h-index
3 publications
71 citations
1–8 of 61
Venues
- SIAM Journal on Discrete Mathematics
12 publications · 1.8K citations
11
h-index
- Journal of Combinatorial Optimization
7 publications · 97 citations
7
h-index
- IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications
4 publications · 126 citations
4
h-index
- The Journal of Chemical Physics
3 publications · 118 citations
3
h-index
- Naval Research Logistics (NRL)
2 publications · 41 citations
2
h-index
1–5