• A. EDWARD SAMUEL
• S. KALAIVANI

In this paper, we launch a new labeling said to be factori-difference labeling and apply to some line graphs. A connected graph G is a factori-difference labeling if there exists a bijection f∶V(G)→{2,3,… ,p} such that the induced function g_f ∶E(G)→N defined as g_f (uv)=([f(u)+f(v)-1]!)/([f(u)-1]![f(v)-1]!) and the edges labels are distinct. Graph which acknowledges a factori-difference labeling is a factori-difference graph. We investigate this labeling conditions satisfies to some line graphs of path, cycle, brush, star, fan, friendship, ladder, sun let, triangular snake, dragon, key graphs and also find the chromatic number of some line graphs.

Factori-difference labeling, Factori-difference graph, line graphs, Chromatic number.

"FACTORI-DIFFERENCE LABELING TO SOME LINE GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 9, page no.957-966, September-2018, Available :http://www.jetir.org/papers/JETIR1809649.pdf

"FACTORI-DIFFERENCE LABELING TO SOME LINE GRAPHS", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 9, page no. pp957-966, September-2018, Available at : http://www.jetir.org/papers/JETIR1809649.pdf