Abstract
For positive numbers j and k, an L(j,k)-labeling f of G is an assignment of numbers to vertices of G such that |f(u)−f(v)|≥j if d(u,v)=1, and |f(u)−f(v)|≥k if d(u,v)=2. The span of f is the difference between the maximum and the minimum numbers assigned by f. The L(j,k)-labeling number of G, denoted by λj,k(G), is the minimum span over all L(j,k)-labelings of G. In this article, we completely determine the L(j,k)-labeling number (2j≤k) of the Cartesian product of path and cycle.
| Original language | English |
|---|---|
| Pages (from-to) | 604-634 |
| Number of pages | 31 |
| Journal | Journal of Combinatorial Optimization |
| Volume | 31 |
| Issue number | 2 |
| Early online date | 2 Aug 2014 |
| DOIs | |
| Publication status | Published - Feb 2016 |
User-Defined Keywords
- Cartesian product
- Cycle
- L(j, k)-labeling
- Path
Fingerprint
Dive into the research topics of 'L(j, k)-labeling number of Cartesian product of path and cycle'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver