Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition
SIAM Journal on Discrete Mathematics
Relating path coverings to vertex labellings with a condition at distance two
Discrete Mathematics
On the $\lambda$-Number of $Q_n$ and Related Graphs
SIAM Journal on Discrete Mathematics
On the size of graphs labeled with condition at distance two
Journal of Graph Theory
The $L(2,1)$-Labeling Problem on Graphs
SIAM Journal on Discrete Mathematics
On L(d, 1)-labelings of graphs
Discrete Mathematics
Hamiltonicity and circular distance two labellings
Discrete Mathematics
Fixed parameter complexity of λ-labelings
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Labeling Products of Complete Graphs with a Condition at Distance Two
SIAM Journal on Discrete Mathematics
On generalized Petersen graphs labeled with a condition at distance two
Discrete Mathematics
Distance-two labelings of graphs
European Journal of Combinatorics
On Regular Graphs Optimally Labeled with a Condition at Distance Two
SIAM Journal on Discrete Mathematics
Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
SIAM Journal on Discrete Mathematics
L(2, 1)-labelings of Cartesian products of two cycles
Discrete Applied Mathematics
Distance-two labelings of digraphs
Discrete Applied Mathematics
Graph labeling and radio channel assignment
Journal of Graph Theory
| Hi-index | 0.04 |
A k-L(d,1)-labeling of a graph G is a function f from the vertex set V(G) to {0,1,...,k} such that |f(u)-f(v)|=1 if d(u,v)=2 and |f(u)-f(v)|=d if d(u,v)=1. The L(d,1)-labeling problem is to find the L(d,1)-labeling number @l"d(G) of a graph G, which is the minimum cardinality k such that G has a k-L(d,1)-labeling. In this paper, we determine the L(d,1)-labeling number of the Cartesian product of a cycle and a path.