IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Labeling trees with a condition at distance two
Discrete Mathematics
L(2, 1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
A note on collections of graphs with non-surjective lambda labelings
Discrete Applied Mathematics
Optimal L(d,1)-labelings of certain direct products of cycles and Cartesian products of cycles
Discrete Applied Mathematics
The L(2, 1)-labelling of trees
Discrete Applied Mathematics
L(2, 1)-labelings of Cartesian products of two cycles
Discrete Applied Mathematics
Conflict-free star-access in parallel memory systems
Journal of Parallel and Distributed Computing
Distance-two labelings of digraphs
Discrete Applied Mathematics
Extremal problems on consecutive L(2,1)-labelling
Discrete Applied Mathematics
An extremal problem on non-full colorable graphs
Discrete Applied Mathematics
(2,1)-Total labelling of outerplanar graphs
Discrete Applied Mathematics
Note: Improved upper bounds on the L(2,1) -labeling of the skew and converse skew product graphs
Theoretical Computer Science
Labelling planar graphs without 4-cycles with a condition on distance two
Discrete Applied Mathematics
On L(d,1)-labeling of Cartesian product of a cycle and a path
Discrete Applied Mathematics
A distance-labelling problem for hypercubes
Discrete Applied Mathematics
Injective coloring of planar graphs
Discrete Applied Mathematics
Distance-two labellings of Hamming graphs
Discrete Applied Mathematics
A general approach to L(h,k)-label interconnection networks
Journal of Computer Science and Technology
Notes: A note on collections of graphs with non-surjective lambda labelings
Discrete Applied Mathematics
L(2,1)-labeling of direct product of paths and cycles
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Optimal L(d,1)-labelings of certain direct products of cycles and Cartesian products of cycles
Discrete Applied Mathematics
Note: The L(2,1)-labelling of trees
Discrete Applied Mathematics
L(2,1)-labelings of Cartesian products of two cycles
Discrete Applied Mathematics
Optimal radio labellings of complete m-ary trees
Discrete Applied Mathematics
Note: L(2,1)-Labelings on the composition of n graphs
Theoretical Computer Science
Group path covering and distance two labeling of graphs
Information Processing Letters
Group path covering and L(j,k)-labelings of diameter two graphs
Information Processing Letters
On backbone coloring of graphs
Journal of Combinatorial Optimization
On the approximability of the L(h, k)-labelling problem on bipartite graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
L(2,1) -labelling of generalized prisms
Discrete Applied Mathematics
On real number labelings and graph invertibility
Discrete Applied Mathematics
On the L(2,1)-labelings of amalgamations of graphs
Discrete Applied Mathematics
L(2,1)-labelings of the edge-path-replacement of a graph
Journal of Combinatorial Optimization
L(d,1)-labelings of the edge-path-replacement of a graph
Journal of Combinatorial Optimization
List backbone colouring of graphs
Discrete Applied Mathematics
| Hi-index | 0.01 |
For integers $j \geq k$, an L(j,k)-labeling of a graph G is an integer labeling of the vertices in V(G) such that adjacent vertices receive integers which differ by at least j, and vertices which are distance two apart receive labels which differ by at least k. We determine $\lambda^j_k(K_n \times K_m)$ for all j,k,m,n, and $\lambda^{2}_1(K^q_{p^r})$ for $3 \leq q