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
Labeling Products of Complete Graphs with a Condition at Distance Two
SIAM Journal on Discrete Mathematics
Graph labeling and radio channel assignment
Journal of Graph Theory
Optimal Channel Assignments for Lattices with Conditions at Distance Two
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
A note on collections of graphs with non-surjective lambda labelings
Discrete Applied Mathematics
Distance-two labelings of digraphs
Discrete Applied Mathematics
Labelling of some planar graphs with a condition at distance two
Journal of Applied Mathematics and Computing
Bounds for the L(d, 1): number of diameter 2 graphs, trees and cacti
International Journal of Mobile Network Design and Innovation
A general approach to L(h,k)-label interconnection networks
Journal of Computer Science and Technology
Distance constrained labelings of planar graphs with no short cycles
Discrete Applied Mathematics
Graph labellings with variable weights, a survey
Discrete Applied Mathematics
Labeling the r-path with a condition at distance two
Discrete Applied Mathematics
Notes: A note on collections of graphs with non-surjective lambda labelings
Discrete Applied Mathematics
L(j,k)-labelling and maximum ordering-degrees for trees
Discrete Applied Mathematics
The L(h,1,1)-labelling problem for trees
European Journal of Combinatorics
Group path covering and L(j,k)-labelings of diameter two graphs
Information Processing Letters
On n-fold L(j,k)-and circular L(j,k)-labelings of graphs
Discrete Applied Mathematics
Distance coloring and distance edge-coloring of d- dimensional lattice
ICIC'12 Proceedings of the 8th international conference on Intelligent Computing Theories and Applications
L(2,1) -labeling of oriented planar graphs
Discrete Applied Mathematics
Hi-index | 0.05 |
For positive integers j ≥ k, an L(j, k)-labeling of graph G is an integer labeling of V(G) such that adjacent vertices receive labels which differ by at least j, and vertices that are distance two apart receive labels which differ by at least k. The λj, k-number of G is the minimum span over the L(j,k)-labelings of G. In this paper, we derive the λj,k-number of the infinite regular tree. For x = j/k, we also introduce a rational variation λx(G) of λj,k(G), and provide a proof that λx(G) is continuous.