Distance-two labelings of digraphs
Discrete Applied Mathematics
The minimum span of L(2,1)-labelings of certain generalized Petersen graphs
Discrete Applied Mathematics
On L(d,1)-labeling of Cartesian product of a cycle and a path
Discrete Applied Mathematics
On the computational complexity of the L(2,1)-labeling problem for regular graphs
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Exact λ-numbers of generalized Petersen graphs of certain higher-orders and on Möbius strips
Discrete Applied Mathematics
L(2,1) -labelling of generalized prisms
Discrete Applied Mathematics
| Hi-index | 0.00 |
For positive integers $j \geq k$, the $\lambda_{j,k}$-number of graph G is the smallest span among all integer labelings of V(G) such that vertices at distance two receive labels which differ by at least k and adjacent vertices receive labels which differ by at least j. We prove that the $\lambda_{j,k}$-number of any r-regular graph is no less than the $\lambda_{j,k}$-number of the infinite r-regular tree $T_{\infty}(r)$. Defining an r-regular graph G to be $(j,k,r)$-optimal if and only if $\lambda_{j,k}(G) = \lambda_{j,k}(T_{\infty}(r))$, we establish the equivalence between $(j,k,r)$-optimal graphs and r-regular bipartite graphs with a certain edge coloring property for the case ${j \over k} r$. The structure of $r$-regular optimal graphs for ${j \over k} \leq r$ is investigated, with special attention to ${j \over k} = 1,2$. For the latter, we establish that a (2,1,r)-optimal graph, through a series of edge transformations, has a canonical form. Finally, we apply our results on optimality to the derivation of the $\lambda_{j,k}$-numbers of prisms.