IRREDUCIBLE NO-HOLE L(2,1)-COLORING OF EDGE-MULTIPLICITY-PATHS-REPLACEMENT GRAPH

An L(2, 1)-coloring (or labeling) of a simple connected graph G is a mapping f : V (G) -> Z+ boolean OR {0} such that |f(u) - f(v)| >= 2 for all edges uv of G, and |f(u) - f(v)| >= 1 if u and v are at distance two in G. The span of an L(2, 1)-coloring f, denoted by span(f), of G is max{f(v) : v is an element of V (G)}. The span of G, denoted by lambda(G), is the minimum span of all possible L(2, 1)-colorings of G. For an L(2, 1)-coloring f of a graph G with span k, an integer l is a hole in f if l is an element of (0, k) and there is no vertex v in G such that f(v) = l. An L(2, 1)-coloring is a no-hole coloring if there is no hole in it, and is an irreducible coloring if color of none of the vertices in the graph can be decreased and yield another L(2, 1)-coloring of the same graph. An irreducible no-hole coloring, in short inh-coloring, of G is an L(2, 1)-coloring of G which is both irreducible and no-hole. For an inh-colorable graph G, the inh-span of G, denoted by lambda(inh)(G), is defined as lambda(inh)(G) - min{span(f) : f is an inh-coloring of G. Given a function h : E(G) -> N - {1}, and a positive integer r >= 2, the edge-multiplicity-paths-replacement graph G(rPh) of G is the graph obtained by replacing every edge uv of G with r paths of length h(uv) each. In this paper we show that G(rP(h)) is inh-colorable except possibly the cases h(e) >= 2 with equality for at least one but not for all edges e and (i) Delta(G) = 2, r = 2 or (ii) Delta(G) >= 3, 2 <= r <= 4. We find the exact value of lambda(inh)(G(rP(h))) in several cases and give upper bounds of the same in the remaining. Moreover, we find the value of lambda(G(rP(h))) in most of the cases which were left by Lu and Sun in [L(2, 1)-labelings of the edge-multiplicity-paths-replacement of a graph, J. Comb. Optim. 31 (2016) 396404].