12

Muthali Murugan

Let G(V,E) be a simple, finite, connected, undirected graph. Distance two labeling or L(2,1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of non-negative integers such that

|f(x)-f(y)| ≥ 2 if x and y are adjacent and |f(x)-f(y)| ≥ 1

if x and y are at distance 2, for all x and y in V(G). The L(2,1)-labeling number λ(G) of G is the smallest number k such that G has an L(2,1)-labeling f with max{f(v):v in V(G)}=k. In this paper, we construct L(2,1)-labeling of subdivisions of cycle dominated graphs like subdivided Double Fans, subdivided nC

Keywords: distance two labeling, transmitters, channel assignment, double fan

Cite this paper:

Murugan M., L(2,1)-Labeling for Subdivisions of cycle dominated graphs

Bull. Comput. Appl. Math. (Bull CompAMa),

Vol. 2, No. 2, Jul-Dec, pp.7-19, 2014

**L(2,1)-Labeling for Subdivisions of Cycle Dominated Graphs**Muthali Murugan

Let G(V,E) be a simple, finite, connected, undirected graph. Distance two labeling or L(2,1)-labeling of a graph G is an assignment f from the vertex set V(G) to the set of non-negative integers such that

|f(x)-f(y)| ≥ 2 if x and y are adjacent and |f(x)-f(y)| ≥ 1

if x and y are at distance 2, for all x and y in V(G). The L(2,1)-labeling number λ(G) of G is the smallest number k such that G has an L(2,1)-labeling f with max{f(v):v in V(G)}=k. In this paper, we construct L(2,1)-labeling of subdivisions of cycle dominated graphs like subdivided Double Fans, subdivided nC

_{α}with a common vertex and subdivided Books B_{n}and hence we find the λ-number of these graphs.Keywords: distance two labeling, transmitters, channel assignment, double fan

Cite this paper:

Murugan M., L(2,1)-Labeling for Subdivisions of cycle dominated graphs

Bull. Comput. Appl. Math. (Bull CompAMa),

Vol. 2, No. 2, Jul-Dec, pp.7-19, 2014