Labelling graphs with a condition at distance 2
SIAM Journal on Discrete Mathematics
On the $\lambda$-Number of $Q_n$ and Related Graphs
SIAM Journal on Discrete Mathematics
Total colorings of planar graphs with large maximum degree
Journal of Graph Theory
List edge and list total colourings of multigraphs
Journal of Combinatorial Theory Series B
Total colourings of planar graphs with large girth
European Journal of Combinatorics
Labeling Products of Complete Graphs with a Condition at Distance Two
SIAM Journal on Discrete Mathematics
Total Colorings of Degenerated Graphs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
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
L(2,1)-labelings of Cartesian products of two cycles
Discrete Applied Mathematics
Hi-index | 0.00 |
For two positive integers j and k with j驴k, an L(j,k)-labeling of a graph G is an assignment of nonnegative integers to V(G) such that the difference between labels of adjacent vertices is at least j, and the difference between labels of vertices that are distance two apart is at least k. The span of an L(j,k)-labeling of a graph G is the difference between the maximum and minimum integers used by it. The L(j,k)-labelings-number of G is the minimum span over all L(j,k)-labelings of G. This paper focuses on L(2,1)-labelings-number of the edge-path-replacement G(P k ) of a graph G. Note that G(P 3) is the incidence graph of G. L(2,1)-labelings of the edge-path-replacement G(P 3) of a graph, called (2,1)-total labeling of G, was introduced by Havet and Yu in 2002 (Workshop graphs and algorithms, Dijon, France, 2003; Discrete Math. 308:498---513, 2008). They (Havet and Yu, Discrete Math. 308:498---513, 2008) obtain the bound $\Delta+1\leq\lambda^{T}_{2}(G)\leq2\Delta+1$ and conjectured $\lambda^{T}_{2}(G)\leq\Delta+3$ . In this paper, we obtain that 驴(G(P k ))驴Δ+2 for k驴5, and conjecture 驴(G(P 4))驴Δ+2 for any graph G with maximum degree Δ.