L(1, 2)-labeling numbers on square of cycles
For two positive numbers d and m, an m-L(1, d)-labeling of a graph G is a mapping such that if and if The span of f is the maximum difference among the numbers assigned by f. The L(1, d)-labeling number of G, denoted by is the minimum span over all L(1, d)-labelings of G. In this paper, we determine...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2020.02.003 |