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
Graph labeling and radio channel assignment
Journal of Graph Theory
Distance-two labelings of digraphs
Discrete Applied Mathematics
Optimal frequency assignments of cycles and powers of cycles
International Journal of Mobile Network Design and Innovation
Note: Improved upper bounds on the L(2,1) -labeling of the skew and converse skew product graphs
Theoretical Computer Science
On L(d,1)-labeling of Cartesian product of a cycle and a path
Discrete Applied Mathematics
Combinatorial optimization in system configuration design
Automation and Remote Control
Distance-two labellings of Hamming graphs
Discrete Applied Mathematics
L(j,k)-labelling and maximum ordering-degrees for trees
Discrete Applied Mathematics
| Hi-index | 0.00 |
For given positive integers j ≥ k, an L(j,k)-labeling of a graph G is a function f : V (G) → {0, 1, 2,...} such that |f(u) - f(v)| ≥ j when dG(u, v) = 1 and |f(u) - f(v)| ≥ k when dG(u, v) = 2. The L(j, k)-labeling number λj,k(G) of G is defined as the minimum m such that there is an L(j, k)-labeling f of G with f(V(G)) ⊆ {0, 1, 2,....,m}. For a graph G of maximum degree Δ ≥ 1 it is the case that λj,k(G) ≥ j + (Δ - 1)k. The purpose of this paper is to study the structures of graphs G with maximum degree Δ ≥ 1 and λj,k(G) = j + (Δ - 1)k.