-labeling numbers of square of paths
For , the -labeling arose from code assignment problem. That is, let , and be positive numbers, an --labeling of a graph is a mapping such that if , and if . The span of is the difference between the maximum and the minimum numbers assigned by . The -labeling number of , denoted by , is the minimum...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2017-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.07.001 |